A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
Authors:
- John SylvaJSJohn Sylva
- Alejandro CremaACAlejandro Crema
- 1 August 2007
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 180 (3) , 1011-1027
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- A method for finding the set of non-dominated vectors for multiple objective integer linear programsEuropean Journal of Operational Research, 2004
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-boundEuropean Journal of Operational Research, 2000
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programmingMathematical Programming, 2000
- A branch and bound algorithm for mixed zero-one multiple objective linear programmingEuropean Journal of Operational Research, 1998
- Multi‐objective combinatorial optimization problems: A surveyJournal of Multi-Criteria Decision Analysis, 1994
- An interactive procedure for multiple objective integer linear programming problemsEuropean Journal of Operational Research, 1993
- Zero—one programming with multiple criteriaEuropean Journal of Operational Research, 1986
- An algorithm for the multiple objective integer linear programming problemEuropean Journal of Operational Research, 1982
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective ProgramJournal of the Operational Research Society, 1977
- A general method for determining the set of all efficient solutions to a linear vectormaximum problemEuropean Journal of Operational Research, 1977