Complexity of some parametric integer and network programming problems
From MaRDI portal
Publication:3712126
DOI10.1007/BF02591893zbMath0585.90065MaRDI QIDQ3712126
Publication date: 1983
Published in: Mathematical Programming (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Sensitivity, stability, parametric optimization (90C31) Boolean programming (90C09)
Related Items
An FPTAS for the parametric knapsack problem, Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts, Approximation algorithms for stochastic combinatorial optimization problems, Parametric problems on graphs of bounded tree-width, Constructing the minimization diagram of a two-parameter problem, Parametric methods in integer linear programming, PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS, An approximation algorithm for a general class of parametric optimization problems, Computing the sequence of \(k\)-cardinality assignments, Approximation Methods for Multiobjective Optimization Problems: A Survey, Special cases of the quadratic assignment problem, Complexity of source-sink monotone 2-parameter min cut, The inverse-parametric knapsack problem, The quickest flow problem, Shadows of Newton polytopes, Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint, Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs, Parametric matroid interdiction, Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh, An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion, Parametric maximal flows in generalized networks – complexity and algorithms, Approximation schemes for the parametric knapsack problem, Algorithms for flows with parametric capacities, A note on the parametric maximum flow problem and some related reoptimization issues, Structural and algorithmic properties for parametric minimum cuts, A fast parametric assignment algorithm with applications in max-algebra, A lower bound for the shortest path problem, Unnamed Item, An FPTAS for the knapsack problem with parametric weights, Note on combinatorial optimization with max-linear objective functions, Some concepts of stability analysis in combinatorial optimization, Graph Clustering in All Parameter Regimes, Analyse de sensibilité pour les problèmes linéaires en variables 0-1, An approximation algorithm for a general class of multi-parametric optimization problems, A comprehensive simplex-like algorithm for network optimization and perturbation analysis, Algorithms and complexity analysis for some flow problems, Unifying known lower bounds via geometric complexity theory, A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering, An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
Cites Work
