A linear algorithm for integer programming in the plane
From MaRDI portal
Publication:1771307
DOI10.1007/S10107-004-0520-0zbMATH Open1079.90581OpenAlexW2033597899MaRDI QIDQ1771307FDOQ1771307
Authors: Sören Laue, Friedrich Eisenbrand 
Publication date: 19 April 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/121635
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Integer Programming with a Fixed Number of Variables
- Title not available (Why is that?)
- Linear Programming in Linear Time When the Dimension Is Fixed
- A Polynomial Algorithm for the Two-Variable Integer Programming Problem
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Title not available (Why is that?)
- Fast integer programming in fixed dimension
- Production Sets with Indivisibilities, Part I: Generalities
- Title not available (Why is that?)
- Covering minima and lattice-point-free convex bodies
- The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
- A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
- Production Sets with Indivisibilities, Part II: The Case of Two Activities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
- Title not available (Why is that?)
- A Fast Algorithm for the Two-Variable Integer Programming Problem
- EFFICIENT ENUMERATION OF GRID POINTS IN A CONVEX POLYGON AND ITS APPLICATION TO INTEGER PROGRAMMING
- Short vectors of planar lattices via continued fractions
Cited In (19)
- Lifting for the integer knapsack cover polyhedron
- EFFICIENT ENUMERATION OF GRID POINTS IN A CONVEX POLYGON AND ITS APPLICATION TO INTEGER PROGRAMMING
- Unbounded knapsack problems with arithmetic weight sequences
- Integer programming with 2-variable equations and 1-variable inequalities
- A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
- A fast algorithm for unbounded monotone integer linear systems with two variables per inequality via graph decomposition
- On minimum integer representations of weighted games
- Split cuts in the plane
- Lower time bounds for integer programming with two variables
- Convex minization over \(\mathbb Z^2\)
- On the exact separation of mixed integer knapsack cuts
- Computing efficiently the lattice width in any dimension
- A Fast Algorithm for the Two-Variable Integer Programming Problem
- Logahedra: a new weakly relational domain
- Efficient lattice width computation in arbitrary dimension
- Integer quadratic programming in the plane
- Polynomial time certifying algorithms for the planar quantified integer programming problem
- On the path-width of integer linear programming
This page was built for publication: A linear algorithm for integer programming in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1771307)
