scientific article; zbMATH DE number 3891122
From MaRDI portal
Publication:3347656
[For the entire collection see Zbl 0552.00017.] An improved interactive branch and bound approach to solve the multicriteria integer linear programming problem is presented. Extensive computer solution of randomly generated problems shows that the method is feasible for solving practical problems of modest size. The computational results illustrate how various options in the method have been implemented. Based on experience to date, it appears that the approach may be a viable alternative for solving multicriteria integer linear programming problems.
Recommendations
- A class of practical interactive branch and bound algorithms for multicriteria integer programming
- scientific article; zbMATH DE number 3902394
- An interactive method for bicriteria integer programming
- An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
- An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
Cited in
(30)- An algorithm for the bi-criterion integer programming problem
- A class of practical interactive branch and bound algorithms for multicriteria integer programming
- Zero-one programming with multiple criteria
- Bicriteria network flow problems: Integer case
- An interactive procedure for multiple objective integer linear programming problems
- An interactive algorithm for solving multiple objective integer linear programming problems
- A binary integer linear program with multi-criteria and multi-constraint levels
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- A fast interactive solution method for large capital expenditure selection problems
- An interactive algorithm for multiple criteria constrained sorting problem
- Multi-objective integer programming: an improved recursive algorithm
- The quasi-reasonable goals method for integer multicriteria optimization problems
- An integer linear programming problem with multi-criteria and multi-constraint levels: A branch-and-partition algorithm
- On a multicriteria problem of integer linear programming
- Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
- A combined approach to solve binary multicriteria problems
- An interactive algorithm to find the most preferred solution of multi-objective integer programs
- An interactive method for bicriteria integer programming
- scientific article; zbMATH DE number 3902394 (Why is no real title available?)
- An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
- scientific article; zbMATH DE number 3943575 (Why is no real title available?)
- scientific article; zbMATH DE number 4100971 (Why is no real title available?)
- An interactive combined branch-and-bound/Tchebycheff algorithm for multiple criteria optimization
- scientific article; zbMATH DE number 553773 (Why is no real title available?)
- scientific article; zbMATH DE number 2000120 (Why is no real title available?)
- Solving electronic spreadsheet models by interactive multicriterion optimization: a budgeting illustration
- scientific article; zbMATH DE number 817543 (Why is no real title available?)
- scientific article; zbMATH DE number 7339100 (Why is no real title available?)
- The combinatorial method for solving the multicriteria linear optimization problem in integers
- A review of interactive methods for multiobjective integer and mixed-integer programming
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 Q3347656)