scientific article; zbMATH DE number 6850361
From MaRDI portal
Publication:4607934
zbMATH Open1410.90128MaRDI QIDQ4607934FDOQ4607934
Authors: Friedrich Eisenbrand, Robert Weismantel 
Publication date: 15 March 2018
Full work available at URL: http://dl.acm.org/citation.cfm?id=3175322
Title of this publication is not available (Why is that?)
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 (34)
- The integrality number of an integer program
- The distributions of functions related to parametric integer optimization
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem
- About the complexity of two-stage stochastic IPs
- The support of integer optimal solutions
- Title not available (Why is that?)
- Scheduling lower bounds via AND subset sum
- Vectors in a box
- Near-linear time algorithm for \(n\)-fold ILPs via color coding
- Integer programming in parameterized complexity: three miniatures
- Distances to lattice points in knapsack polyhedra
- On integer programming and convolution
- Local linear set on graphs with bounded twin cover number
- Distances between optimal solutions of mixed-integer programs
- Proximity in concave integer quadratic programming
- On lattice point counting in \(\varDelta\)-modular polyhedra
- The Integrality Number of an Integer Program
- From approximate to exact integer programming
- Integer programming in parameterized complexity: five miniatures
- Title not available (Why is that?)
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
- Title not available (Why is that?)
- Proximity bounds for random integer programs
- Proximity bounds for random integer programs
- Tight complexity lower bounds for integer linear programming with few constraints
- About the Complexity of Two-Stage Stochastic IPs
- Faster Algorithms for Integer Programs with Block Structure
- Distance-sparsity transference for vertices of corner polyhedra
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
- A colorful Steinitz lemma with application to block-structured integer programs
- Combinatorial \(n\)-fold integer programming and applications
- On Proximity for k-Regular Mixed-Integer Linear Optimization
- On the optimality of pseudo-polynomial algorithms for integer programming
- On the optimality of pseudo-polynomial algorithms for 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)
