The L-shape search method for triobjective integer programming
- 4 September 2015
- journal article
- research article
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 8 (2) , 217-251
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective caseComputers & Operations Research, 2013
- Multiobjective evolutionary algorithms: A survey of the state of the artSwarm and Evolutionary Computation, 2011
- 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
- Performance assessment of multiobjective optimizers: an analysis and reviewIEEE Transactions on Evolutionary Computation, 2003
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear programEuropean Journal of Operational Research, 2002
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programmingMathematical Programming, 2000
- An algorithm for the multiple objective integer linear programming problemEuropean Journal of Operational Research, 1982