An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
From MaRDI portal
Publication:2274869
DOI10.1007/s10898-019-00778-xzbMath1429.90071OpenAlexW2943476941WikidataQ127953415 ScholiaQ127953415MaRDI QIDQ2274869
Ozgu Turgut, Evrim Dalkiran, Alper Ekrem Murat
Publication date: 1 October 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00778-x
Related Items
On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming ⋮ Finding non dominated points for multiobjective integer convex programs with linear constraints ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ A decision space algorithm for multiobjective convex quadratic integer optimization ⋮ Split algorithms for multiobjective integer programming problems ⋮ Exact method based on solution space cut for bi-objective Seru production
Uses Software
Cites Work
- On the representation of the search region in multi-objective optimization
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- Finding all nondominated points of multi-objective integer programs
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Bound sets for biobjective combinatorial optimization problems
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Lipschitzian optimization without the Lipschitz constant
- Efficient computation of the search region in multi-objective optimization
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Multi-objective integer programming: an improved recursive algorithm
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
- An Algorithm for Multiobjective Zero-One Linear Programming
