On the public citation graph
Easy to say they are Hard, but Hard to see they are Easy- Towards a Categorization of Tractable Multiobjective Combinatorial Optimization Problems
0 signed · 64 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/mcda.1603openalex-snapshot
Output-sensitive complexity of multiobjective combinatorial optimization
inferredcites →https://doi.org/10.1002/mcda.4020030204openalex-snapshot
Multi‐objective combinatorial optimization problems: A survey
inferredcites →https://doi.org/10.1002/nav.3800020109openalex-snapshot
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1002/nav.3800260112openalex-snapshot
The enumeration of all efficient solutions for a linear multiple‐objective transportation problem
inferredcites →https://doi.org/10.1002/net.10010openalex-snapshot
A linear‐size zero—one programming model for the minimum spanning tree problem in planar graphs
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_3openalex-snapshot
Integral Boundary Points of Convex Polyhedra
inferredcites →https://doi.org/10.1007/978-3-642-46618-2_15openalex-snapshot
Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-642-57311-8_5openalex-snapshot
Hard to Say It’s Easy — Four Reasons Why Combinatorial Multiobjective Programmes Are Hard
inferredcites →https://doi.org/10.1007/s002910000046openalex-snapshot
A survey and annotated bibliography of multiobjective combinatorial optimization
inferredcites →https://doi.org/10.1007/s101070050011openalex-snapshot
Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
inferredcites →https://doi.org/10.1007/s10589-013-9551-xopenalex-snapshot
Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem
inferredcites →https://doi.org/10.1007/s10957-005-5494-4openalex-snapshot
Approximation Methods in Multiobjective Programming
inferredcites →https://doi.org/10.1007/s10957-011-9849-8openalex-snapshot
Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization
inferredcites →https://doi.org/10.1016/0167-6377(92)90064-aopenalex-snapshot
Total unimodularity applications in bi-objective discrete optimization
inferredcites →https://doi.org/10.1016/0196-6774(84)90042-7openalex-snapshot
Efficient algorithms for a family of matroid intersection problems
inferredcites →https://doi.org/10.1016/0377-2217(90)90297-oopenalex-snapshot
The discrete p-dispersion problem
inferredcites →https://doi.org/10.1016/j.cor.2007.09.009openalex-snapshot
Solving efficiently the 0–1 multi-objective knapsack problem
inferredcites →https://doi.org/10.1016/j.cor.2011.02.010openalex-snapshot
Greedy algorithms for a class of knapsack problems with binary weights
inferredcites →https://doi.org/10.1016/j.cor.2012.10.010openalex-snapshot
Multicriteria 0-1 knapsack problems with k-min objectives
inferredcites →https://doi.org/10.1016/j.cor.2015.05.003openalex-snapshot
Representation of the non-dominated set in biobjective discrete optimization
inferredcites →https://doi.org/10.1016/j.ejor.2008.07.047openalex-snapshot
Implementing an efficient fptas for the 0–1 multi-objective knapsack problem
inferredcites →https://doi.org/10.1016/j.orl.2012.03.007openalex-snapshot
Generalized multiple objective bottleneck problems
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.022openalex-snapshot
Efficiently computing succinct trade-off curves
inferredcites →https://doi.org/10.1016/s0166-218x(98)00063-8openalex-snapshot
Adjacency on the constrained assignment problem
inferredcites →https://doi.org/10.1016/s0377-2217(96)00116-6openalex-snapshot
Connectedness of efficient solutions in multiple criteria combinatorial optimization
inferredcites →https://doi.org/10.1016/s0377-2217(99)00261-1openalex-snapshot
Approximation algorithms for knapsack problems with cardinality constraints
inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1023/a:1008258310679openalex-snapshot
Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem
inferredcites →https://doi.org/10.1023/a:1012602011914openalex-snapshot
Label Correcting Methods to Solve Multicriteria Shortest Path Problems
inferredcites →https://doi.org/10.1080/02331939608844238openalex-snapshot
On matroids with multiple objectives
inferredcites →https://doi.org/10.1093/bioinformatics/btt098openalex-snapshot
Improvements on bicriteria pairwise sequence alignment: algorithms and applications
inferredcites →https://doi.org/10.1109/tevc.2003.810758openalex-snapshot
Performance assessment of multiobjective optimizers: an analysis and review
inferredcites →https://doi.org/10.1109/tsmc.1971.4308298openalex-snapshot
On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
inferredcites →https://doi.org/10.1287/mnsc.25.1.73openalex-snapshot
Bicriteria Transportation Problem
inferredcites →https://doi.org/10.1287/mnsc.48.12.1603.445openalex-snapshot
Approximating Multiobjective Knapsack Problems
inferredcites →https://doi.org/10.2307/2008156openalex-snapshot
Progress in Combinatorial Optimization.
inferredcites →https://doi.org/10.4230/dagrep.5.1.96openalex-snapshot
Understanding Complexity in Multiobjective Optimization (Dagstuhl Seminar 15031)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mcda.1780openalex-snapshot
Exact algorithms for multiobjective linear optimization problems with integer variables: A state of the art survey
inferred← citeshttps://doi.org/10.1002/mcda.70024openalex-snapshot
On Supportedness in Multi‐Objective Integer Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-031-25263-1_8openalex-snapshot
Theoretical Aspects of Subset Selection in Multi-Objective Optimisation
inferred← citeshttps://doi.org/10.1007/978-3-031-70068-2_5openalex-snapshot
Identifying Easy Instances to Improve Efficiency of ML Pipelines for Algorithm-Selection
inferred← citeshttps://doi.org/10.1007/s00186-023-00841-0openalex-snapshot
A simple, efficient and versatile objective space algorithm for multiobjective integer programming
inferred← citeshttps://doi.org/10.1007/s10107-024-02121-zopenalex-snapshot
On the strength of Lagrangian duality in multiobjective integer programming
inferred← citeshttps://doi.org/10.1007/s10278-018-0138-zopenalex-snapshot
Multi-objective Parameter Auto-tuning for Tissue Image Segmentation Workflows
inferred← citeshttps://doi.org/10.1007/s10878-025-01289-0openalex-snapshot
A multi-objective perspective on the cable-trench problem
inferred← citeshttps://doi.org/10.1007/s10898-019-00745-6openalex-snapshot
Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions
inferred← citeshttps://doi.org/10.1007/s10898-020-00898-9openalex-snapshot
An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
inferred← citeshttps://doi.org/10.1007/s12532-025-00276-0openalex-snapshot
K-shortest simple paths using biobjective path search
inferred← citeshttps://doi.org/10.1016/j.cor.2022.105857openalex-snapshot
What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization
inferred← citeshttps://doi.org/10.1016/j.dam.2025.06.001openalex-snapshot
An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.10.034openalex-snapshot
Preprocessing and cut generation techniques for multi-objective binary programming
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.01.001openalex-snapshot
Distribution based representative sets for multi-objective integer programs
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.12.018openalex-snapshot
Solving the Multiobjective Quasi-clique Problem
inferred← citeshttps://doi.org/10.1016/j.orl.2025.107302openalex-snapshot
On the computational complexity of ordinal multi-objective unconstrained combinatorial optimization
inferred← citeshttps://doi.org/10.1038/s43588-025-00873-yopenalex-snapshot
Quantum approximate multi-objective optimization
inferred← citeshttps://doi.org/10.1038/s43588-025-00936-0openalex-snapshot
Improving the balance of trade-offs in multi-objective optimization with quantum computing
inferred← citeshttps://doi.org/10.1080/02331934.2022.2044479openalex-snapshot
Biobjective optimization problems on matroids with binary costs
inferred← citeshttps://doi.org/10.1145/3449639.3459360openalex-snapshot
On the design and anytime performance of indicator-based branch and bound for multi-objective combinatorial optimization
inferred← citeshttps://doi.org/10.1287/ijoc.2024.0798openalex-snapshot
The Parallel Epsilon Algorithm for Triobjective Integer Optimization Problems
inferred← citeshttps://doi.org/10.3390/electronics15102217openalex-snapshot
Enhanced Discrete Multi-Objective Particle Swarm Optimization for Electromagnetic Spectrum Planning
inferred← citeshttps://doi.org/10.48550/arxiv.1810.02911openalex-snapshot
Tuning for Tissue Image Segmentation Workflows for Accuracy and Performance
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.