An algorithm for the multiple objective integer linear programming problem
References (26)
- et al.
Discrete right hand side parametrization for linear integer programs
European J. Operational Res.
(1978) - et al.
The set of all nondominated solutions in linear cases and in multicriteria simplex method
J. Math. Anal. Appl.
(1975) Integer linear programming with multiple objectives
Ann. Discrete Math.
(1977)- et al.
An algorithm for generating efficient solutions to the multiple objective integer programming problem
(1978) An additive algorithm for solving linear programs with zero-one variables
Operations Res.
(1965)Linear multiple objective programs with zero-one variables
Math. Programming
(1977)Theory and algorithms for linear multiple objective programs with zero-one variables
Math. Programming
(1979)- et al.
Finding efficient points for linear multiple objective programs
Math. Programming
(1975) - et al.
A revised simplex method for linear multiple objective programs
Math. Programming
(1973) - et al.
Multiparametric linear programming
Management Sci.
(1972)
Integer Programming
(1972)
Parametric and postoptimal analysis in integer linear programming
Management Sci.
(1977)
Using duality theory for identification of primal efficient points and for sensitivity analysis in multiple objective linear programming
J. Operational Res. Soc.
(1978)
Cited by (103)
Optimization of a quadratic programming problem over an integer efficient set
2024, Journal of Computational and Applied MathematicsNew ϵ−constraint methods for multi-objective integer linear programming: A Pareto front representation approach
2023, European Journal of Operational ResearchBranch-and-bound and objective branching with three or more objectives
2022, Computers and Operations ResearchCitation Excerpt :This problem can be circumvented if the search procedure employs a “one-tree” search strategy where the method searches for efficient solutions in the decision space instead of searching for non-dominated outcomes in the objective space. One of the first Branch-and-Bound (B&B) based algorithms for multi-objective integer programming problems was developed by Klein and Hannan (1982). The algorithm uses post optimality techniques to solve a series of integer problems all in one tree structure.
Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
2022, European Journal of Operational ResearchA stochastic optimization model for staged hospital evacuation during hurricanes
2021, Transportation Research Part E: Logistics and Transportation ReviewEffective anytime algorithm for multiobjective combinatorial optimization problems
2021, Information Sciences
Copyright © 1982 Published by Elsevier B.V.