On the public citation graph

Output-sensitive complexity of multiobjective combinatorial optimization

https://doi.org/10.1002/mcda.1603
0 signed · 57 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-349-13908-8_1openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-24777-7openalex-snapshot
Knapsack Problems
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-48782-8_9openalex-snapshot
Bicriterion Path Problems
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-3-662-48350-3_25openalex-snapshot
Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems
inferredcites →https://doi.org/10.1007/bf01920568openalex-snapshot
Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
inferredcites →https://doi.org/10.1007/bf02032304openalex-snapshot
On spanning tree problems with multiple objectives
inferredcites →https://doi.org/10.1007/bf02293050openalex-snapshot
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
inferredcites →https://doi.org/10.1007/s00453-006-0068-xopenalex-snapshot
Multicriteria Global Minimum Cuts
inferredcites →https://doi.org/10.1007/s00454-008-9050-5openalex-snapshot
Generating All Vertices of a Polyhedron Is Hard
inferredcites →https://doi.org/10.1007/s10479-006-0074-zopenalex-snapshot
A discussion of scalarization techniques for multiple objective integer programming
inferredcites →https://doi.org/10.1007/s10898-011-9709-yopenalex-snapshot
A dual variant of Benson’s “outer approximation algorithm” for multiple objective linear programming
inferredcites →https://doi.org/10.1007/s10898-013-0098-2openalex-snapshot
Benson type algorithms for linear vector optimization and applications
inferredcites →https://doi.org/10.1016/0020-0190(88)90065-8openalex-snapshot
On generating all maximal independent sets
inferredcites →https://doi.org/10.1016/0191-2615(79)90024-9openalex-snapshot
A model and algorithm for multicriteria route-mode choice
inferredcites →https://doi.org/10.1016/0377-2217(84)90077-8openalex-snapshot
On a multicriteria shortest path problem
inferredcites →https://doi.org/10.1016/b978-0-12-473750-1.50001-1openalex-snapshot
Mathematics in Science and Engineering
inferredcites →https://doi.org/10.1016/j.cor.2005.10.003openalex-snapshot
Bound sets for biobjective combinatorial optimization problems
inferredcites →https://doi.org/10.1016/j.ejor.2004.08.029openalex-snapshot
An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
inferredcites →https://doi.org/10.1016/j.ejor.2010.10.008openalex-snapshot
A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization
inferredcites →https://doi.org/10.1016/j.ejor.2015.01.035openalex-snapshot
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
inferredcites →https://doi.org/10.1016/j.ejor.2015.03.031openalex-snapshot
On the representation of the search region in multi-objective optimization
inferredcites →https://doi.org/10.1016/j.tcs.2007.02.034openalex-snapshot
Decision-making based on approximate and smoothed Pareto curves
inferredcites →https://doi.org/10.1017/cbo9780511804090openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1023/a:1008215702611openalex-snapshot
An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem
inferredcites →https://doi.org/10.1080/02331939608844238openalex-snapshot
On matroids with multiple objectives
inferredcites →https://doi.org/10.1137/0209042openalex-snapshot
Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
inferredcites →https://doi.org/10.1137/060674831openalex-snapshot
Geometric Duality in Multiple Objective Linear Programming
inferredcites →https://doi.org/10.1201/9781420010749-38openalex-snapshot
Sensitivity Analysis in Combinatorial Optimization
inferredcites →https://doi.org/10.1287/ijoc.1090.0342openalex-snapshot
A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
inferredcites →https://doi.org/10.1287/mnsc.1100.1248openalex-snapshot
An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
inferredcites →https://doi.org/10.1287/mnsc.25.1.73openalex-snapshot
Bicriteria Transportation Problem
inferredcites →https://doi.org/10.1287/opre.22.1.189openalex-snapshot
Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
inferredcites →https://doi.org/10.2307/3323470openalex-snapshot
Lecture Notes in Economics and Mathematical Systems

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.1574openalex-snapshot
Easy to say they are Hard, but Hard to see they are Easy- Towards a Categorization of Tractable Multiobjective Combinatorial Optimization Problems
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-60599-4_6openalex-snapshot
LEO: Learning Efficient Orderings for Multiobjective Binary Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-53925-6_15openalex-snapshot
Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-54157-0_6openalex-snapshot
The Multiobjective Shortest Path Problem Is NP-Hard, or Is It?
inferred← citeshttps://doi.org/10.1007/978-981-95-7127-7_37openalex-snapshot
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00186-023-00847-8openalex-snapshot
An outer approximation algorithm for generating the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems
inferred← citeshttps://doi.org/10.1007/s00186-024-00850-7openalex-snapshot
Complexity of the multiobjective minimum weight minimum stretch spanner problem
inferred← citeshttps://doi.org/10.1007/s10878-025-01376-2openalex-snapshot
Output-sensitive complexity of multi-objective integer network flow problems
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/s10898-020-00951-7openalex-snapshot
One-exact approximate Pareto sets
inferred← citeshttps://doi.org/10.1007/s11590-019-01471-4openalex-snapshot
On efficiency of a single variable bi-objective optimization algorithm
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.04.020openalex-snapshot
A graph-based algorithm for the multi-objective optimization of gene regulatory networks
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.2025.06.012openalex-snapshot
Fifty years of multi-objective optimization and decision-making: From mathematical programming to evolutionary computation
inferred← citeshttps://doi.org/10.1016/j.ifacol.2019.11.157openalex-snapshot
Robust Two-Stage Packing into Designated and Multipurpose Bins
inferred← citeshttps://doi.org/10.1017/9781108637435.020openalex-snapshot
Smoothed Analysis of Pareto Curves in Multiobjective Optimization
inferred← citeshttps://doi.org/10.1080/02331934.2022.2044479openalex-snapshot
Biobjective optimization problems on matroids with binary costs
inferred← citeshttps://doi.org/10.3390/a12090189openalex-snapshot
Parameterised Enumeration for Modification Problems
inferred← citeshttps://doi.org/10.3390/ijgi7070258openalex-snapshot
Multi-Objective Optimisation Based Planning of Power-Line Grid Expansions
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.