Improved penalty calculations for a mixed integer branch-and-bound algorithm

DOI10.1007/BF01580237MaRDI QIDQ4079323zbMATH OpenFDO

Authors Prabhakant Sinha, Ronald D. Armstrong

Publication date 1974

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01580237

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cites work

• A Branch-and-Bound Algorithm for Zero-One Mixed Integer Programming Problems
• Branch-and-Bound Methods: A Survey
• Curvature and Radius of Curvature for Functions with Bounded Boundary Rotation
• Experiments in mixed-integer linear programming
• Generalized upper bounding techniques
• scientific article; zbMATH DE number 3427119 (Why is no real title available?)
• scientific article; zbMATH DE number 3523329 (Why is no real title available?)
• scientific article; zbMATH DE number 3526452 (Why is no real title available?)
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Integer Programming and Pricing
• Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)
• Partitioning procedures for solving mixed-variables programming problems

Cited in

(4)

• On the calculation of true and pseudo penalties in multiple choice integer programming
• Computational comparison on the partitioning strategies in multiple choice integer programming
• Penalty computations for the set partitioning problem
• Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming

This page was built for publication: Improved penalty calculations for a mixed integer branch-and-bound algorithm

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