Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- 16 September 1999
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 117 (3) , 565-577
- https://doi.org/10.1016/s0377-2217(98)00269-0
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Cutting planes for integer programs with general integer variablesMathematical Programming, 1998
- Gomory cuts revisitedOperations Research Letters, 1996
- A reference direction approach to multiple objective integer linear programmingEuropean Journal of Operational Research, 1995
- An interactive algorithm for solving multiple objective integer linear programming problemsEuropean Journal of Operational Research, 1994
- Multi‐objective combinatorial optimization problems: A surveyJournal of Multi-Criteria Decision Analysis, 1994
- A Reference Direction Algorithm for Solving Multiple Objective Integer Linear Programming ProblemsJournal of the Operational Research Society, 1993
- Use of reference points for MOLP problems analysisEuropean Journal of Operational Research, 1993
- An interactive procedure for multiple objective integer linear programming problemsEuropean Journal of Operational Research, 1993
- A lift-and-project cutting plane algorithm for mixed 0–1 programsMathematical Programming, 1993
- Analysis of mathematical programming problems prior to applying the simplex algorithmMathematical Programming, 1975