The following pages link to MOIP_AIRA (Q43588):
Displayed 17 items.
- (Q47582) (redirect page) (← links)
- A cutting plane approach for multi-objective integer indefinite quadratic programming problem (Q260685) (← links)
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
- The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
- Multiobjective optimization for multimode transportation problems (Q721075) (← links)
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
- SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems (Q828878) (← links)
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
- An interactive approximation algorithm for multi-objective integer programs (Q1652656) (← links)
- An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing (Q1734819) (← links)
- Efficient computation of the search region in multi-objective optimization (Q1753505) (← links)
- Finding a representative nondominated set for multi-objective mixed integer programs (Q1991106) (← links)
- Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
- An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems (Q2274869) (← links)
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947) (← links)
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs (Q2672116) (← links)
- Multiobjective Integer Programming: Synergistic Parallel Approaches (Q3386777) (← links)