Generalized multiple objective bottleneck problems
Authors:
- Jochen GorskiJGJochen Gorski
- Kathrin KlamrothKKKathrin Klamroth
- Stefan RuzikaSRStefan Ruzika
- 1 July 2012
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 40 (4) , 276-281
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Greedy algorithms for a class of knapsack problems with binary weightsComputers & Operations Research, 2012
- Connectedness of Efficient Solutions in Multiple Objective Combinatorial OptimizationJournal of Optimization Theory and Applications, 2011
- Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function4OR, 2006
- An improved general procedure for lexicographic bottleneck problemsOperations Research Letters, 1999
- Lexicographic optimisation in generalised network flow problemsJournal of the Operational Research Society, 1998
- Lexicographic bottleneck problemsOperations Research Letters, 1991
- The Constrained Bottleneck Problem in NetworksOperations Research, 1990
- Efficient algorithms for a family of matroid intersection problemsJournal of Algorithms, 1984
- Minimal spanning tree subject to a side constraintComputers & Operations Research, 1982
- Bottleneck extremaJournal of Combinatorial Theory, 1970