Easy to say they are Hard, but Hard to see they are Easy- Towards a Categorization of Tractable Multiobjective Combinatorial Optimization Problems-Reference-Cited by-同舟云学术

Easy to say they are Hard, but Hard to see they are Easy- Towards a Categorization of Tractable Multiobjective Combinatorial Optimization Problems

Published:2016-09-26 Issue:1-2 Volume:24 Page:82-98
ISSN:1057-9214
Container-title:Journal of Multi-Criteria Decision Analysis
language:en
Short-container-title:J. Multi-Crit. Decis. Anal.

Author:

Figueira José Rui¹,Fonseca Carlos M.²,Halffmann Pascal³,Klamroth Kathrin⁴,Paquete Luís²,Ruzika Stefan³,Schulze Britta⁴,Stiglmayr Michael⁴,Willems David³

Affiliation:

1. CEG-IST Instituto Superior Técnico; Universidade de Lisboa; Lisboa Portugal

2. CISUC, Department of Informatics Engineering; University of Coimbra; Coimbra Portugal

3. Mathematical Institute; University of Koblenz-Landau; Koblenz Germany

4. School of Mathematics and Natural Sciences; University of Wuppertal; Wuppertal Germany

Funder

Deutscher Akademischer Austauschdienst

Fundação para a Ciência e a Tecnologia

Massachusetts Department of Fish and Game

Bundesministerium für Bildung und Forschung

Publisher

Wiley

Subject

Strategy and Management,General Decision Sciences

Reference51 articles.

1. Improvements on bicriteria pairwise sequence alignment: algorithms and applications;Abbasi;Bioinformatics,2013

2. Adjacency on the constrained assignment problem;Alfakih;Discrete Applied Mathematics,1998

3. Bicriteria transportation problem;Aneja;Management Science,1979

4. Implementing an efficient FPTAS for the 0-1 multi-objective knapsack problem;Bazgan;European Journal of Operational Research,2009a

5. Solving efficiently the 0-1 multi-objective knapsack problem;Bazgan;Computers & Operations Research,2009b

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the strength of Lagrangian duality in multiobjective integer programming;Mathematical Programming;2024-08-20

2. A simple, efficient and versatile objective space algorithm for multiobjective integer programming;Mathematical Methods of Operations Research;2024-03-21

3. Identifying Easy Instances to Improve Efficiency of ML Pipelines for Algorithm-Selection;Lecture Notes in Computer Science;2024

4. Theoretical Aspects of Subset Selection in Multi-Objective Optimisation;Natural Computing Series;2023

5. What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization;Computers & Operations Research;2022-09