Sensitivity Analysis for Branch and Bound Integer Programming

DOI10.1287/OPRE.33.5.1008MaRDI QIDQ3706845zbMATH OpenOpenAlexFDO

Authors Linus Schrage, Laurence A. Wolsey

Publication date 1985

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.33.5.1008

zbMATH Keywords

branch-and-boundcutsmixed integer programmingpostoptimal analysissensitivity analysis

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Non-linear integer programming: Sensitivity analysis for branch and bound
• Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
• Sensitivity analysis of mixed integer programs: An application to environmental policy making
• Analyse de sensibilité pour les problèmes linéaires en variables 0-1
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming

Cited in

(23)

• Sensitivity analysis of mixed integer programs: An application to environmental policy making
• Non-linear integer programming: Sensitivity analysis for branch and bound
• An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem
• L-shaped decomposition of two-stage stochastic programs with integer recourse
• Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
• Compact representation of near-optimal integer programming solutions
• Parametric methods in integer linear programming
• Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
• Real-time personnel re-scheduling after a minor disruption in the retail industry
• Postoptimal Analysis in Nonserial Dynamic Programming
• Challenges in Enterprise Wide Optimization for the Process Industries
• scientific article; zbMATH DE number 1114459 (Why is no real title available?)
• Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
• scientific article; zbMATH DE number 764459 (Why is no real title available?)
• scientific article; zbMATH DE number 6419199 (Why is no real title available?)
• Multiple cost coefficients sensitivity theorems of integer linear optimization
• Solving stochastic and bilevel mixed-integer programs via a generalized value function
• Analyse de sensibilité pour les problèmes linéaires en variables 0-1
• Sensitivity analysis of efficient solution in vector MINMAX Boolean programming problem
• Evaluating mixed-integer programming models over multiple right-hand sides
• An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
• Approximating the stability region for binary mixed-integer programs
• Using intervals for global sensitivity and worst-case analyses in multiattribute value trees

This page was built for publication: Sensitivity Analysis for Branch and Bound Integer Programming

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