Lexicographic bottleneck combinatorial problems

DOI10.1016/S0167-6377(98)00028-5zbMath0957.90113OpenAlexW2087701391MaRDI QIDQ1306468

P. T. Sokkalingam, Yash P. Aneja

Publication date: 4 October 1999

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00028-5

zbMATH Keywords

combinatorial optimizationbottleneck objectivelexicographic linear programs

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (11)

Computation of equilibria and the price of anarchy in bottleneck congestion games ⋮ Assignment problems: a golden anniversary survey ⋮ A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks ⋮ The dominance assignment problem ⋮ Bottleneck partial-matching Voronoi diagrams and applications ⋮ Lexicographic balanced optimization problems ⋮ The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases ⋮ A class of bottleneck expansion problems ⋮ On \(k\)-Max-optimization ⋮ On the hierarchical Chinese postman problem with linear ordered classes ⋮ Solving some lexicographic multi-objective combinatorial problems

Cites Work

• Scaling algorithms for network problems
• Lexicographic bottleneck problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lexicographic bottleneck combinatorial problems