Complexity of some parametric integer and network programming problems
From MaRDI portal
Recommendations
- Computational Complexity of Some Problems in Parametric Discrete Programming. I
- Parametric integer programming
- Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
- Parametric maximal flows in generalized networks – complexity and algorithms
- A parametric algorithm for convex cost network flow and related problems
Cites work
- scientific article; zbMATH DE number 3702681 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- A bad network problem for the simplex method and other minimum cost flow algorithms
- Aggregation of equations in integer programming
- Computational complexity of parametric linear programming
- Convex Analysis
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Cited in
(44)- The quickest flow problem
- Complexity of source-sink monotone 2-parameter min cut
- Special cases of the quadratic assignment problem
- Structural and algorithmic properties for parametric minimum cuts
- Constructing the minimization diagram of a two-parameter problem
- Parametric methods in integer linear programming
- The inverse-parametric knapsack problem
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- An upper bound on the number of extreme shortest paths in arbitrary dimensions
- Parametric maximal flows in generalized networks – complexity and algorithms
- PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS
- Approximation algorithms for stochastic combinatorial optimization problems
- Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
- A note on the parametric maximum flow problem and some related reoptimization issues
- Note on combinatorial optimization with max-linear objective functions
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Computing the sequence of \(k\)-cardinality assignments
- Algorithms for flows with parametric capacities
- Optimization of an SMD placement machine and flows in parametric networks
- An FPTAS for the parametric knapsack problem
- Graph Clustering in All Parameter Regimes
- A lower bound for the shortest path problem
- Computational Complexity of Some Problems in Parametric Discrete Programming. I
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- Unifying known lower bounds via geometric complexity theory
- Some concepts of stability analysis in combinatorial optimization
- Algorithms and complexity analysis for some flow problems
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
- An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion
- Parametric problems on graphs of bounded tree-width
- Integer programming in parameterized complexity: five miniatures
- An approximation algorithm for a general class of parametric optimization problems
- Exponential lower bounds for many pivot rules for the simplex method
- A fast parametric assignment algorithm with applications in max-algebra
- A polynomial algorithm for a class of 0-1 fractional programming problems involving composite functions, with an application to additive clustering
- An approximation algorithm for a general class of multi-parametric optimization problems
- Approximation schemes for the parametric knapsack problem
- A survey of exact and approximation algorithms for linear-parametric optimization problems
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- An FPTAS for the knapsack problem with parametric weights
- Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
- Parametric matroid interdiction
- Shadows of Newton polytopes
This page was built for publication: Complexity of some parametric integer and network programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3712126)
