Constructing Lattice-Free Gradient Polyhedra in Dimension Two
From MaRDI portal
Publication:5041758
DOI10.1007/978-3-030-45771-6_28zbMath1503.90084OpenAlexW3021995655MaRDI QIDQ5041758
Miriam Schlöter, Joseph Paat, Emily Speakman
Publication date: 14 October 2022
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45771-6_28
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
- Duality for mixed-integer convex minimization
- An algorithmic framework for convex mixed integer nonlinear programs
- Geometric algorithms and combinatorial optimization
- Optimality certificates for convex minimization and Helly numbers
- A geometric approach to cut-generating functions
- Convexity in cristallographical lattices
- Unique Minimal Liftings for Simplicial Polytopes
- Maximal Lattice-Free Convex Sets in Linear Subspaces
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- An observation on the structure of production sets with indivisibilities
- A Theorem Concerning the Integer Lattice
- Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three
- Mirror-Descent Methods in Mixed-Integer Convex Optimization
- Inequalities from Two Rows of a Simplex Tableau
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Relaxations of mixed integer sets from lattice-free polyhedra
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
