Generalized multiple objective bottleneck problems
From MaRDI portal
Publication:453049
DOI10.1016/j.orl.2012.03.007zbMath1247.90223OpenAlexW2056394316MaRDI QIDQ453049
Stefan Ruzika, Jochen Gorski, Kathrin Klamroth
Publication date: 18 September 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2252
Related Items (6)
Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions ⋮ Shortest paths with shortest detours. A biobjective routing problem ⋮ Variable-sized uncertainty and inverse problems in robust optimization ⋮ On solving bi-objective constrained minimum spanning tree problems ⋮ Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization ⋮ Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connectedness of efficient solutions in multiple objective combinatorial optimization
- On a multicriteria shortest path problem
- Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
- On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
- On \(k\)-Max-optimization
- The tricriterion shortest path problem with at least two bottleneck objective functions
- Reducibility of minimax to minisum 0-1 programming problems
- Lexicographic bottleneck problems
- An \(O(m\log n)\) algorithm for the max+sum spanning tree problem
- An improved general procedure for lexicographic bottleneck problems
- On the sum-max bicriterion path problem.
- Investigation of a linear convolution of criteria in multicriterial discrete programming
- Lexicographic balanced optimization problems
- Numerical analysis of tricriteria tree and assignment problems
- Greedy algorithms for a class of knapsack problems with binary weights
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- Minimax and applications
- The linear convolution of criteria in the bicriteria traveling salesman problem
- Lexicographic optimisation in generalised network flow problems
- Efficient algorithms for a family of matroid intersection problems
- The Constrained Bottleneck Problem in Networks
- Shortest chain subject to side constraints
- Solving 0-1 Minimax Problems
- Bottleneck extrema
- Study of the linear parametrization of criteria in the bicriteria knapsack problem
This page was built for publication: Generalized multiple objective bottleneck problems
