Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
From MaRDI portal
Publication:537960
DOI10.1007/s10898-010-9554-4zbMath1219.90110OpenAlexW1985624218MaRDI QIDQ537960
Publication date: 23 May 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9554-4
linear programmingconvex programmingmixed integer programminginterior point methodsanalytic centerlattice basis reductionvolumetric center
Related Items
Column basis reduction and decomposable knapsack problems, A study of lattice reformulations for integer programming, Compressing branch-and-bound trees, Lattice Reformulation Cuts, Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems, On the volumetric path, A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management, On the Structure of Reduced Kernel Lattice Bases
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branching on general disjunctions
- Improved strategies for branching on general disjunctions
- On the finite convergence of interior-point algorithms for linear programming
- Non-standard approaches to integer programming
- Column basis reduction and decomposable knapsack problems
- On Lovász' lattice reduction and the nearest lattice point problem
- Factoring polynomials with rational coefficients
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Finding an interior point in the optimal face of linear programs
- Topics in semidefinite and interior-point methods
- Segment LLL reduction of lattice bases using modular arithmetic
- New volume ratio properties for convex symmetric bodies in \({\mathbb{R}}^ n\)
- A new algorithm for minimizing convex functions over convex sets
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier
- Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
- Integer Programming with a Fixed Number of Variables
- On the Complexity of Selecting Disjunctions in Integer Programming
- The Generalized Basis Reduction Algorithm
- An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
- Towards a Practical Volumetric Cutting Plane Method for Convex Programming
- Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
- Rounding of Polytopes in the Real Number Model of Computation
- Cuts for Conic Mixed-Integer Programming
- Hard Equality Constrained Integer Knapsacks
- Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
