Lexicographic bottleneck combinatorial problems

DOI10.1016/S0167-6377(98)00028-5MaRDI QIDQ1306468zbMATH OpenOpenAlexFDO

Authors P. T. Sokkalingam, Y. 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

bottleneck objectivecombinatorial optimizationlexicographic linear programs

Mathematics Subject Classification ID

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

Recommendations

• Lexicographic bottleneck problems
• An improved general procedure for lexicographic bottleneck problems
• Solving some lexicographic multi-objective combinatorial problems
• Lexicographic balanced optimization problems
• About a lexicographic multicriteria bottleneck problem

Cites work

• scientific article; zbMATH DE number 432790 (Why is no real title available?)
• scientific article; zbMATH DE number 3825556 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Lexicographic bottleneck problems
• Network flows. Theory, algorithms, and applications.
• Scaling algorithms for network problems

Cited in

(14)

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

This page was built for publication: Lexicographic bottleneck combinatorial problems

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