Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
From MaRDI portal
Publication:3783056
DOI10.1007/BF01920568zbMath0641.90037OpenAlexW2072486042MaRDI QIDQ3783056
No author found.
Publication date: 1988
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01920568
worst-case analysisnetwork flow problemsparametric capacitiesbicriterial min-cost flowexponential number of breakpointsmulticriterial flowspathological graph
Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)
Related Items
Multiobjective transportation network design and routing problems: Taxonomy and annotation, A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem, Multiple objective minimum cost flow problems: a review, On finding representative non-dominated points for bi-objective integer network flow problems, An approximation algorithm for a general class of parametric optimization problems, A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems, Bound sets for biobjective combinatorial optimization problems, Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint, Parametric matroid interdiction, \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows, The multiscenario lot size problem with concave costs., A two-phase algorithm for the biobjective integer minimum cost flow problem, Finding non-dominated solutions in bi-objective integer network flow problems, Approximation of convex curves with application to the bicriterial minimum cost flow problem, On the computation of all supported efficient solutions in multi-objective integer network flow problems, An approximation algorithm for a general class of multi-parametric optimization problems, On the efficient point set of tricriteria linear programs
Cites Work
