Generalized multiple objective bottleneck problems

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
The linear convolution of criteria in the bicriteria traveling salesman problem
Bottleneck extrema
Minimax and applications
On the sum-max bicriterion path problem.
Greedy algorithms for a class of knapsack problems with binary weights
On a multicriteria shortest path problem
An improved general procedure for lexicographic bottleneck problems
Lexicographic bottleneck problems
Efficient algorithms for a family of matroid intersection problems
Shortest chain subject to side constraints
Lexicographic balanced optimization problems
Lexicographic optimisation in generalised network flow problems
Connectedness of efficient solutions in multiple objective combinatorial optimization
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
An \(O(m\log n)\) algorithm for the max+sum spanning tree problem
Investigation of a linear convolution of criteria in multicriterial discrete programming
Numerical analysis of tricriteria tree and assignment problems
Solving combinatorial problems with combined min-max-min-sum objective and applications
The Constrained Bottleneck Problem in Networks
Solving 0-1 Minimax Problems
Study of the linear parametrization of criteria in the bicriteria knapsack 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

Cited In (9)

Shortest paths with shortest detours. A biobjective routing problem
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
Monomial Tropical Cones for Multicriteria Optimization
Generalized target-allocation functions and their evaluation by the branch-and-bound method
Variable-sized uncertainty and inverse problems in robust optimization
Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
On solving bi-objective constrained minimum spanning tree problems
Bucket elimination for multiobjective optimization 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)