Generalized multiple objective bottleneck problems
From MaRDI portal
(Redirected from Publication:453049)
Recommendations
- Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
- The tricriterion shortest path problem with at least two bottleneck objective functions
- The multiobjective bottleneck transportation problem.
- Generalized Bottleneck Problems∗
- On spanning tree problems with multiple objectives
Cites work
- scientific article; zbMATH DE number 3833720 (Why is no real title available?)
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- An O(m n) algorithm for the max+sum spanning tree problem
- An improved general procedure for lexicographic bottleneck problems
- Bottleneck extrema
- Connectedness of efficient solutions in multiple objective combinatorial optimization
- Efficient algorithms for a family of matroid intersection problems
- Greedy algorithms for a class of knapsack problems with binary weights
- Investigation of a linear convolution of criteria in multicriterial discrete programming
- Lexicographic balanced optimization problems
- Lexicographic bottleneck problems
- Lexicographic optimisation in generalised network flow problems
- Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
- Minimax and applications
- Numerical analysis of tricriteria tree and assignment problems
- On k-Max-optimization
- On a multicriteria shortest path problem
- On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
- On the sum-max bicriterion path problem.
- Reducibility of minimax to minisum 0-1 programming problems
- Shortest chain subject to side constraints
- Solving 0-1 Minimax Problems
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- Study of the linear parametrization of criteria in the bicriteria knapsack problem
- The Constrained Bottleneck Problem in Networks
- The linear convolution of criteria in the bicriteria traveling salesman problem
- The tricriterion shortest path problem with at least two bottleneck objective functions
Cited in
(18)- Shortest paths with shortest detours. A biobjective routing problem
- Multiple objective optimization and implications for single objective optimization.
- Pyramidal tours and multiple objectives
- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
- Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
- Generalized target-allocation functions and their evaluation by the branch-and-bound method
- Monomial Tropical Cones for Multicriteria Optimization
- A note on the asymptotic behaviour of bottleneck problems
- Variable-sized uncertainty and inverse problems in robust optimization
- On universal and multiobjective model extensions for combinatorial optimization problems
- On k-Max-optimization
- The tricriterion shortest path problem with at least two bottleneck objective functions
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
- Generalized Bottleneck Problems∗
- On solving bi-objective constrained minimum spanning tree problems
- Bucket elimination for multiobjective optimization problems
- Some relationships between multicriteria and parametric discrete optimization problems with bottleneck objectives
- Solving some lexicographic multi-objective combinatorial problems
This page was built for publication: Generalized multiple objective bottleneck problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453049)
