scientific article; zbMATH DE number 1149798
From MaRDI portal
Publication:4387178
Cited in
(13)- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems
- Solving the Multiple Objective Integer Linear Programming Problem
- Solution approaches for equitable multiobjective integer programming problems
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- 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
- The use of classification theory for automated selection of algorithms in program packages
- An improved algorithm for solving biobjective integer programs
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
- A review of interactive methods for multiobjective integer and mixed-integer programming
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- A survey of interval algorithms for solving multicriteria analysis problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4387178)
