File(s) under permanent embargo

The approximability of three-dimensional assignment problems with bottleneck objective

Version 2 2024-06-04, 14:22

Version 1 2018-05-01, 17:42

journal contribution

posted on 2024-06-04, 14:22 authored by D Goossens, Sergey PolyakovskiySergey Polyakovskiy, FCR Spieksma, GJ Woeginger

The approximability of three-dimensional assignment problems with bottleneck objective

History

Journal

OPTIMIZATION LETTERS

Volume

4

Pagination

7-16

Location

Berlin, Germany

Publisher DOI

https://doi.org/10.1007/s11590-009-0152-7

ISSN

1862-4472

eISSN

1862-4480

Language

English

Author URL

http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000272181600002&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=a045e4b2bb1f2b747c68c720ec8913b7

Publication classification

C Journal article, C1.1 Refereed article in a scholarly journal

Issue

1

Publisher

SPRINGER HEIDELBERG

Usage metrics

Categories

Keywords

Science & Technology Technology Physical Sciences Operations Research & Management Science Mathematics, Applied Mathematics Bottleneck problem Multidimensional assignment Approximation Computational complexity Efficient algorithm APPROXIMATION ALGORITHMS School of Information Technology

Licence

All Rights Reserved

Exports

RefWorks

BibTeX

Ref. manager

Endnote

DataCite

NLM

DC