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

DOI10.1007/BF01580237zbMath0317.90041MaRDI QIDQ4079323

Prabhakant Sinha, Ronald D. Armstrong

Publication date: 1974

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Generalized upper bounding techniques
• Integer Programming and Pricing
• Branch-and-Bound Methods: A Survey
• A Branch-and-Bound Algorithm for Zero-One Mixed Integer Programming Problems
• Experiments in mixed-integer linear programming
• Curvature and Radius of Curvature for Functions with Bounded Boundary Rotation
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)

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