A branch-and-bound algorithm for 0-1 parametric mixed integer programming

DOI10.1016/0167-6377(85)90050-1MaRDI QIDQ1061012zbMATH OpenOpenAlexFDO

Authors Yoshiaki Ohtake, Naonori Nishida

Publication date 1985

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(85)90050-1

zbMATH Keywords

branch-and-bound algorithmparametric mixed integer linear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Boolean programming (90C09) Integer programming (90C10) Mixed integer programming (90C11) Sensitivity, stability, parametric optimization (90C31)

Review text

A branch-and-bound algorithm to solve 0-1 parametric mixed integer linear programming problems has been developed. The present algorithm is an extension of the branch-and-bound algorithm for parametric analysis on pure integer programming. The characteristic of the present method is that optimal solutions for all values of the parameter can be obtained.

Recommendations

• An algorithm for multiparametric mixed-integer linear programming problems
• Parametric mixed-integer 0-1 linear programming: The general case for a single parameter
• An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program
• An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function
• An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem

Cites work

• Discrete right hand side parametrization for linear integer programs
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• scientific article; zbMATH DE number 3709922 (Why is no real title available?)
• scientific article; zbMATH DE number 3550466 (Why is no real title available?)
• scientific article; zbMATH DE number 3564693 (Why is no real title available?)
• Integer Programming Post-Optimal Analysis with Cutting Planes
• Parametric integer linear programming: A synthesis of branch and bound with cutting planes
• Parametric Mixed Integer Programming: An Application to Solid Waste Management

Cited in

(16)

• An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem
• A procedure to verify the completeness of the right-hand-side parametric analysis for a mixed integer linear programming problem
• An algorithm for multiparametric mixed-integer linear programming problems
• An improved branch and bound algorithm for mixed integer nonlinear programs
• A new bounding technique in branch-and-bound algorithms for mixed integer programming
• Parametric uncapacitated facility location
• 0-1 linear integer programming method for granule knowledge reduction and attribute reduction in concept lattices
• A branch and bound method for the solution of multiparametric mixed integer linear programming problems
• Parametric methods in integer linear programming
• Theoretical and algorithmic advances in multi-parametric programming and control
• scientific article; zbMATH DE number 1953196 (Why is no real title available?)
• A branch-and-bound algorithm for parametric mixed-binary nonlinear programs
• A computational study of parametric tabu search for 0-1 mixed integer programs
• Parameterisation algorithms for the integer linear programs in binary variables
• An implicit branch-and-bound algorithm for mixed-integer linear programming
• Parametric mixed-integer 0-1 linear programming: The general case for a single parameter

This page was built for publication: A branch-and-bound algorithm for 0-1 parametric mixed integer programming

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