Bound sets for biobjective combinatorial optimization problems
Authors:
- Matthias EhrgottMEMatthias Ehrgott
- Xavier GandibleuxXGXavier Gandibleux
- 1 September 2007
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 34 (9) , 2674-2694
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Computation of ideal and Nadir values and implications for their use in MCDM methodsEuropean Journal of Operational Research, 2003
- Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problemsEuropean Journal of Operational Research, 2003
- Performance assessment of multiobjective optimizers: an analysis and reviewIEEE Transactions on Evolutionary Computation, 2003
- A survey and annotated bibliography of multiobjective combinatorial optimizationOR Spectrum, 2000
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programmingMathematical Programming, 2000
- Approximation algorithms for combinatorial multicriteria optimization problemsInternational Transactions in Operational Research, 2000
- A branch and bound algorithm for mixed zero-one multiple objective linear programmingEuropean Journal of Operational Research, 1998
- Complexity results for multicriterial and parametric network flows using a pathological graph of ZadehMathematical Methods of Operations Research, 1988
- Multicriteria dynamic programming with an application to the integer caseJournal of Optimization Theory and Applications, 1982
- A combined approach to solve binary multicriteria problemsNaval Research Logistics Quarterly, 1982