Parametric integer linear programming: A synthesis of branch and bound with cutting planes

DOI10.1016/0377-2217(82)90158-8zbMath0481.90077OpenAlexW1981037850MaRDI QIDQ1162446

Suzanne L. K. Rountree, Billy E. Gillett

Publication date: 1982

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc1181425/

zbMATH Keywords

branch and boundlower boundcutting planesimplicit enumeration methodparametric integer linear programmingfathoming tests

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items (9)

Zur kepplimg eines exakten verfahrens mit einem heuristiscieb verfahren für die lösung ganzzahliger linearer optimierungsprobleme ⋮ Parametric methods in integer linear programming ⋮ Theoretical and algorithmic advances in multi-parametric programming and control ⋮ An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem ⋮ Parametric uncapacitated facility location ⋮ Parametric nonlinear integer programming: The right-hand side case ⋮ A contraction for the multiparametric integer linear programming problem ⋮ Parameterisation algorithms for the integer linear programs in binary variables ⋮ A branch-and-bound algorithm for 0-1 parametric mixed integer programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Outline of an algorithm for integer solutions to linear programs
• Parametric Integer Programming Analysis: A Contraction Approach
• Integer Programming Post-Optimal Analysis with Cutting Planes
• Postoptimality analysis in integer programming by implicit enumeration: The mixed integer case
• Some Easy Postoptimality Analysis for Zero-One Programming
• Implicit enumeration based algorithms for postoptimizing zero-one programs
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• A hybrid approach to discrete mathematical programming
• A tree-search algorithm for mixed integer programming problems
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Postoptimality analysis in zero‐one programming by implicit enumeration

This page was built for publication: Parametric integer linear programming: A synthesis of branch and bound with cutting planes