Lexicographic bottleneck problems

Authors:
Rainer E. Burkard;Franz Rendl
Affiliations:
Technische Universität Graz, Institut für Mathematik, Kopernikusgasse 24, A-8010 Graz, Austria;Technische Universität Graz, Institut für Mathematik, Kopernikusgasse 24, A-8010 Graz, Austria
Venue:
Operations Research Letters
Year:
1991

Citing 0
Cited 5

An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints

Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Lexicographic bottleneck combinatorial problems

Operations Research Letters
An improved general procedure for lexicographic bottleneck problems

Operations Research Letters
Computational aspects of the maximum diversity problem

Operations Research Letters
Total time minimization of fuzzy transportation problem

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Hybrid approaches for approximate reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study combinatorial optimization problems with bottleneck objective function, where any feasible solution has the same number of elements. In addition to minimizing the largest element of a feasible solution we are interested in minimizing also the second largest element, the third largest element, and so on. For this version of the bottleneck problem two generic solution procedures are developed and analyzed. The first is based on scaling the cost elements. In the second approach an optimal solution is constructed iteratively. Both methods have polynomial running time, provided the underlying sum optimization problem is polynomially solvable.