An improved general procedure for lexicographic bottleneck problems

DOI10.1016/S0167-6377(99)00013-9zbMath0954.90039OpenAlexW2071231483MaRDI QIDQ1306359

Vangelis Th. Paschos, Frederico Della Croce, Alexis Tsoukiàs

Publication date: 9 February 2001

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

Full work available at URL: https://doi.org/10.1016/s0167-6377(99)00013-9

zbMATH Keywords

combinatorial optimizationbottleneck problemlexicographic problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (13)

Computation of equilibria and the price of anarchy in bottleneck congestion games ⋮ On discrete optimization with ordering ⋮ Revisiting \(k\)-sum optimization ⋮ The dominance assignment problem ⋮ Bottleneck partial-matching Voronoi diagrams and applications ⋮ Generalized multiple objective bottleneck problems ⋮ Lexicographic balanced optimization problems ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ Conjoint axiomatization of Min, DiscriMin and LexiMin ⋮ A preference-based approach to spanning trees and shortest paths problems ⋮ Computer science and decision theory ⋮ On \(k\)-Max-optimization ⋮ Fair optimization and networks: a survey

Cites Work

• A note on two problems in connexion with graphs
• Lexicographic bottleneck problems
• Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
• Lexicographic optimisation in generalised network flow problems
• Foundational aspects of theories of measurement
• Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
• An algebraic approach to assignment problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved general procedure for lexicographic bottleneck problems