A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
Top Cited Papers
- 1 February 2014
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 232 (3) , 479-488
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Labeling algorithms for multiple objective integer knapsack problemsComputers & Operations Research, 2010
- K-PPM: A new exact method to solve multi-objective combinatorial optimization problemsEuropean Journal of Operational Research, 2010
- An exact -constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with ProfitsEuropean Journal of Operational Research, 2009
- Solving efficiently the 0–1 multi-objective knapsack problemComputers & Operations Research, 2009
- A discussion of scalarization techniques for multiple objective integer programmingAnnals of Operations Research, 2006
- A method for finding the set of non-dominated vectors for multiple objective integer linear programsEuropean Journal of Operational Research, 2004
- Computation of ideal and Nadir values and implications for their use in MCDM methodsEuropean Journal of Operational Research, 2003
- Multi‐objective combinatorial optimization problems: A surveyJournal of Multi-Criteria Decision Analysis, 1994
- On the characterization of noninferior solutions of the vector optimization problemAutomatica, 1982
- Optimality and non-scalar-valued performance criteriaIEEE Transactions on Automatic Control, 1963