Bisection search algorithm for optimizing over the efficient set
From MaRDI portal
Recommendations
- An algorithm for optimizing over the efficient set
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- Decomposition branch and bound algorithm for optimization problems over efficient sets
- An effective iterated tabu search for the maximum bisection problem
- scientific article; zbMATH DE number 6500694
- A method for optimizing over the integer efficient set
- Optimization over the efficient set
- Optimization over the efficient set
- Optimization over the efficient set of a bicriteria convex programming problem
- An algorithm for optimizing over the weakly-efficient set
Cited in
(10)- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem
- A computationally efficient algorithm for determination of efficient max-ordering optimal solutions in multiple objective programming
- scientific article; zbMATH DE number 6500694 (Why is no real title available?)
- Outcome-Space Polyblock Approximation Algorithm for Optimizing over Efficient Sets
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
- scientific article; zbMATH DE number 219844 (Why is no real title available?)
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
- Optimization over the efficient set
This page was built for publication: Bisection search algorithm for optimizing over the efficient set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1592677)
