The following pages link to (Q4387178):
Displaying 12 items.
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case (Q339612) (← links)
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming (Q814696) (← links)
- An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (Q828841) (← links)
- A review of interactive methods for multiobjective integer and mixed-integer programming (Q869154) (← links)
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (Q872117) (← links)
- Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems (Q2256164) (← links)
- An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
- A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level (Q2821098) (← links)
- The use of classification theory for automated selection of algorithms in program packages (Q3026192) (← links)
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming (Q3598043) (← links)
- Solving the Multiple Objective Integer Linear Programming Problem (Q3627676) (← links)
