New constraint methods for multi-objective integer linear programming: A Pareto front representation approach
Authors:
- Mariana Mesquita-CunhaMMMariana Mesquita-Cunha
- José Rui FigueiraJFJosé Rui Figueira
- Ana Paula Barbosa-PóvoaABAna Paula Barbosa-Póvoa
Top Cited Papers
Open Access
- 28 July 2022
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 306 (1) , 286-307
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- An improved version of the augmented ε-constraint method (AUGMECON2) for finding the exact pareto set in multi-objective integer programming problemsApplied Mathematics and Computation, 2013
- Multi-objective integer programming: A general approach for generating all non-dominated solutionsEuropean Journal of Operational Research, 2009
- An exact method for computing the nadir values in multiple objective linear programmingEuropean Journal of Operational Research, 2009
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programsEuropean Journal of Operational Research, 2007
- A review of interactive methods for multiobjective integer and mixed-integer programmingEuropean Journal of Operational Research, 2007
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint methodEuropean Journal of Operational Research, 2006
- A method for finding the set of non-dominated vectors for multiple objective integer linear programsEuropean Journal of Operational Research, 2004
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programmingMathematical Programming, 2000
- Computational experience concerning payoff tables and minimum criterion values over the efficient setEuropean Journal of Operational Research, 1988
- An algorithm for the multiple objective integer linear programming problemEuropean Journal of Operational Research, 1982