Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions
- 7 February 2019
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 74 (3) , 495-522
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Output-sensitive complexity of multiobjective combinatorial optimizationJournal of Multi-Criteria Decision Analysis, 2017
- Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems2015
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphsMathematical Programming, 2015
- 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
- A survey and annotated bibliography of multiobjective combinatorial optimizationOR Spectrum, 2000
- Outcome Space Partition of the Weight Set in Multiobjective Linear ProgrammingJournal of Optimization Theory and Applications, 2000
- Algorithms in Combinatorial Geometry1987
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- Bicriteria Transportation ProblemManagement Science, 1979
- Partition of SpaceThe American Mathematical Monthly, 1943