scientific article; zbMATH DE number 6850361
From MaRDI portal
Publication:4607934
Recommendations
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
- scientific article; zbMATH DE number 3885655
- Proximity bounds for random integer programs
- Proximity bounds for random integer programs
- The complexity of approximate algorithms for the problem of integer programming
- From approximate to exact integer programming
- Proximity in concave integer quadratic programming
- Tightness of sensitivity and proximity bounds for integer linear programs
- Some proximity and sensitivity results in quadratic integer programming
- On the optimality of pseudo-polynomial algorithms for integer programming
Cited in
(37)- Local linear set on graphs with bounded twin cover number
- An FPTAS for the -modular multidimensional knapsack problem
- The integrality number of an integer program
- About the complexity of two-stage stochastic IPs
- Scheduling lower bounds via AND subset sum
- Proximity in concave integer quadratic programming
- On lattice point counting in -modular polyhedra
- Distances to lattice points in knapsack polyhedra
- Combinatorial \(n\)-fold integer programming and applications
- Distances between optimal solutions of mixed-integer programs
- Integer programming in parameterized complexity: five miniatures
- On the optimality of pseudo-polynomial algorithms for integer programming
- The support of integer optimal solutions
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
- Faster Algorithms for Integer Programs with Block Structure
- Integer programming in parameterized complexity: three miniatures
- On the optimality of pseudo-polynomial algorithms for integer programming
- About the Complexity of Two-Stage Stochastic IPs
- The Integrality Number of an Integer Program
- On integer programming and convolution
- Tight complexity lower bounds for integer linear programming with few constraints
- Capacitated dynamic programming: faster knapsack and graph algorithms
- Near-linear time algorithm for \(n\)-fold ILPs via color coding
- The distributions of functions related to parametric integer optimization
- Near-linear time algorithm for n-fold ILPs via color coding
- Distance-sparsity transference for vertices of corner polyhedra
- On Proximity for k-Regular Mixed-Integer Linear Optimization
- scientific article; zbMATH DE number 7651172 (Why is no real title available?)
- Proximity bounds for random integer programs
- Proximity bounds for random integer programs
- From approximate to exact integer programming
- A colorful Steinitz lemma with application to block-structured integer programs
- Scheduling lower bounds via and subset sum
- Sparsity and integrality gap transference bounds for integer programs
- Vectors in a box
- Sparsity and proximity transference in integer programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607934)
