A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization

DOI10.1016/j.ejor.2010.10.008zbMath1211.90215OpenAlexW2018645487MaRDI QIDQ631100

Takeaki Uno, Yoshio Okamoto

Publication date: 22 March 2011

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.10.008

zbMATH Keywords

linear programmingcomplexity theory

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric algorithms and combinatorial optimization.
• Metaheuristics for multiobjective optimisation
• Reverse search for enumeration
• On matroids with multiple objectives
• An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
• Multicriteria Optimization
• Stochastic Algorithms: Foundations and Applications
• Graph-Theoretic Concepts in Computer Science
• Generating all vertices of a polyhedron is hard