Space-efficient algorithm for integer programming with few constraints
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3225500 (Why is no real title available?)
- scientific article; zbMATH DE number 7788439 (Why is no real title available?)
- scientific article; zbMATH DE number 7788444 (Why is no real title available?)
- A near-linear pseudopolynomial time algorithm for subset sum
- An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables
- An application of simultaneous diophantine approximation in combinatorial optimization
- Carathéodory bounds for integer cones
- Integer Programming with a Fixed Number of Variables
- Logspace versions of the theorems of Bodlaender and Courcelle
- On Integer Programming, Discrepancy, and Convolution
- On problems related to unbounded SubsetSum: a unified combinatorial approach
- On the complexity of integer programming
- Polynomial-Time Aggregation of Integer Programming Problems
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
- Relationships between nondeterministic and deterministic tape complexities
- Saving space by algebraization
- The complexity of restricted spanning tree problems
- The subspace flatness conjecture and faster integer programming
- Tight complexity lower bounds for integer linear programming with few constraints
This page was built for publication: Space-efficient algorithm for integer programming with few constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880114)
