Parametric formulation of the general integer linear programming problem
From MaRDI portal
Publication:1919968
DOI10.1016/0305-0548(94)00077-LzbMath0854.90099OpenAlexW2072775075MaRDI QIDQ1919968
Publication date: 19 January 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)00077-l
Integer programming (90C10) Mixed integer programming (90C11) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)
Related Items
An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane ⋮ Theoretical and algorithmic advances in multi-parametric programming and control ⋮ A framework for constructing general integer problems with well-determined duality gaps ⋮ Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem
Cites Work
- Unnamed Item
- A surrogate cutting plane algorithm for all-integer programming
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- Integer Rounding for Polymatroid and Branching Optimization Problems
- An advanced dual algorithm with constraint relaxation for all-integer programming
- Cyclic Scheduling via Integer Programs with Circular Ones
- A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
- Vertex packings: Structural properties and algorithms
- All-integer linear programming — a new approach via dynamic programming
- An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
- An exact ceiling point algorithm for general integer linear programming
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables
