An improved general procedure for lexicographic bottleneck problems

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

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

Publication date: 9 February 2001

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

zbMATH Keywords

combinatorial optimization; bottleneck problem; lexicographic problem

Mathematics Subject Classification ID

90C27: Combinatorial optimization

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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