An improved general procedure for lexicographic bottleneck problems

DOI10.1016/S0167-6377(99)00013-9MaRDI QIDQ1306359zbMATH OpenOpenAlexFDO

Authors Vangelis Th. Paschos, F. Della Croce, Alexis Tsoukias

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)

Recommendations

• Lexicographic bottleneck problems
• Lexicographic bottleneck combinatorial problems
• About a lexicographic multicriteria bottleneck problem
• Solving some lexicographic multi-objective combinatorial problems
• Discrete lexicographic \(p\)-bottleneck problems. I.

Cites work

• scientific article; zbMATH DE number 3759934 (Why is no real title available?)
• scientific article; zbMATH DE number 3564689 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A note on two problems in connexion with graphs
• An algebraic approach to assignment problems
• Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
• Foundational aspects of theories of measurement
• Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
• Lexicographic bottleneck problems
• Lexicographic optimisation in generalised network flow problems

Cited in

(19)

• Lexicographic balanced optimization problems
• Bottleneck partial-matching Voronoi diagrams and applications
• About a lexicographic multicriteria bottleneck problem
• A preference-based approach to spanning trees and shortest paths problems
• Discrete lexicographic \(p\)-bottleneck problems. I.
• A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness
• Conjoint axiomatization of Min, DiscriMin and LexiMin
• Ordered weighted average optimization in multiobjective spanning tree problem
• Computation of equilibria and the price of anarchy in bottleneck congestion games
• The dominance assignment problem
• Generalized multiple objective bottleneck problems
• Studies of lexicography in the generalized network simplex method
• On k-Max-optimization
• On discrete optimization with ordering
• Discrete lexicographic \(p\)-bottleneck problems. II.
• Computer science and decision theory
• Revisiting k-sum optimization
• Fair optimization and networks: a survey
• Solving some lexicographic multi-objective combinatorial problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306359)