Pages that link to "Item:Q3598043"
From MaRDI portal
The following pages link to Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming (Q3598043):
Displaying 14 items.
- On the representation of the search region in multi-objective optimization (Q319674) (← links)
- A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
- A new complexity result on multiobjective linear integer programming using short rational generating functions (Q691389) (← links)
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (Q872117) (← links)
- Efficient computation of the search region in multi-objective optimization (Q1753505) (← links)
- Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming (Q1758882) (← links)
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs (Q1827646) (← links)
- A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme (Q2899069) (← links)
- An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function (Q3621972) (← links)
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems (Q4995057) (← links)
- Using lexicographic parametric programming for searching a non-dominated set in multiple-objective linear programming (Q5690283) (← links)
- An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs (Q5879665) (← links)
- An algorithm to solve multi-objective integer quadratic programming problem (Q6596965) (← links)
- A simple, efficient and versatile objective space algorithm for multiobjective integer programming (Q6616283) (← links)
