Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
From MaRDI portal
Publication:3598043
DOI10.1051/ro:2008018zbMath1153.90511OpenAlexW2169735180MaRDI QIDQ3598043
Publication date: 29 January 2009
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/105408
Integer programming (90C10) Mixed integer programming (90C11) Multi-objective and goal programming (90C29)
Related Items (5)
On the representation of the search region in multi-objective optimization ⋮ A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods ⋮ Efficient computation of the search region in multi-objective optimization ⋮ An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function ⋮ Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Zero-one programming with multiple criteria
- The design of multiactivity multifacility systems
- An interactive procedure for multiple objective integer linear programming problems
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Linear multiple objective programs with zero–one variables
- Multi‐objective combinatorial optimization problems: A survey
This page was built for publication: Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
