The approximability of three-dimensional assignment problems with bottleneck objective (Q845547): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Dries R. Goossens / rank
Normal rank
 
Property / author
 
Property / author: Dries R. Goossens / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-009-0152-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153180732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for three-dimensional assignment problems with triangle inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar 3DM is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the maximum intercluster distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three dimensional bottleneck assignment problem and its variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for multi-index transportation problems with decomposable costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric three-dimensional assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specially Structured Precedence Constraints in Three-Dimensional Bottleneck Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for a bottleneck Steiner tree problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:50, 2 July 2024

scientific article
Language Label Description Also known as
English
The approximability of three-dimensional assignment problems with bottleneck objective
scientific article

    Statements

    The approximability of three-dimensional assignment problems with bottleneck objective (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    bottleneck problem
    0 references
    multidimensional assignment
    0 references
    approximation
    0 references
    computational complexity
    0 references
    efficient algorithm
    0 references

    Identifiers