Parametric formulation of the general integer linear programming problem

DOI10.1016/0305-0548(94)00077-LMaRDI QIDQ1919968zbMATH OpenOpenAlexFDO

Authors A. Joseph

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

zbMATH Keywords

heuristicinteger programmingconvex polytopeparametric approach

Mathematics Subject Classification ID

Linear programming (90C05) Sensitivity, stability, parametric optimization (90C31) Integer programming (90C10) Mixed integer programming (90C11)

Recommendations

• scientific article; zbMATH DE number 3883951
• Parametric methods in integer linear programming
• scientific article; zbMATH DE number 3847219
• scientific article; zbMATH DE number 3892937
• scientific article; zbMATH DE number 3959128

Cites work

• scientific article; zbMATH DE number 3880440 (Why is no real title available?)
• A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables
• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• A surrogate cutting plane algorithm for all-integer programming
• All-integer linear programming — a new approach via dynamic programming
• An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
• An advanced dual algorithm with constraint relaxation for all-integer programming
• An exact ceiling point algorithm for general integer linear programming
• Cyclic Scheduling via Integer Programs with Circular Ones
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• Integer Rounding for Polymatroid and Branching Optimization Problems
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• Vertex packings: Structural properties and algorithms

Cited in

(7)

• Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem
• Generalized nonlinear Lagrangian formulation for bounded integer programming
• An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane
• A contraction for the multiparametric integer linear programming problem
• Theoretical and algorithmic advances in multi-parametric programming and control
• A framework for constructing general integer problems with well-determined duality gaps
• Parametric nonlinear integer programming: The right-hand side case

This page was built for publication: Parametric formulation of the general integer linear programming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1919968)