Cited in
(20)- A cutting plane approach for multi-objective integer indefinite quadratic programming problem
- SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- Multiobjective Integer Programming: Synergistic Parallel Approaches
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
- Multiobjective optimization for multimode transportation problems
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- The \(L\)-shape search method for triobjective integer programming
- Finding a representative nondominated set for multi-objective mixed integer programs
- EMOO
- BENSOLVE
- BOCBLP
- MOrepo
- Solution approaches for equitable multiobjective integer programming problems
- Efficient computation of the search region in multi-objective optimization
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
- An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing
- An interactive approximation algorithm for multi-objective integer programs
This page was built for software: MOIP_AIRA
