An improved general procedure for lexicographic bottleneck problems

DOI10.1016/S0167-6377(99)00013-9zbMATH Open0954.90039OpenAlexW2071231483MaRDI QIDQ1306359FDOQ1306359

F. Della Croce, Vangelis Th. Paschos, 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

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.

zbMATH Keywords

combinatorial optimizationbottleneck problemlexicographic problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

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

Cited In (16)

• Lexicographic balanced optimization problems
• Bottleneck partial-matching Voronoi diagrams and applications
• A preference-based approach to spanning trees and shortest paths problems
• 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
• 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)