The dominance assignment problem

DOI10.1016/j.disopt.2012.06.001zbMath1254.90188OpenAlexW1973714008MaRDI QIDQ1926493

Gilberto Calvillo, David Romero

Publication date: 28 December 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2012.06.001

zbMATH Keywords

permutationsassignment problemcombinatorial matricesclutterbottleneck assignmentlexicographic bottleneck assignment

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• A multi-level bottleneck assignment approach to the bus drivers' rostering problem
• Assignment problems: a golden anniversary survey
• Lexicographic bottleneck problems
• The NP-completeness of the bandwidth minimization problem
• An augmenting path method for solving linear bottleneck assignment problems
• An improved general procedure for lexicographic bottleneck problems
• Lexicographic bottleneck combinatorial problems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Assignment Problems
• Algorithms for two bottleneck optimization problems
• An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
• Bottleneck extrema
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem