Experiments in mixed-integer linear programming

1971/12/01 by M. Benichou, J. M. Gauthier, P. Girodet +4 · 304 citations
Decision Sciences · Engineering · Mathematics · #Advanced Optimization Algorithms Research #Branch and bound #Branch and cut #Branch and price #Combinatorics #Computer science #Heuristic #IBM #Integer (computer science) #Integer programming #Linear programming #Linear programming relaxation #Mathematical optimization #Mathematics #Multi-Criteria Decision Making #Optimization and Mathematical Programming #Tree (set theory)

paper · doi:10.1007/bf01584074

published in Mathematical Programming 1(1), 76-94 (Springer Science+Business Media)

openalex publication_date 1971/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Citations

• A tree-search algorithm for mixed integer programming problems

Cited by

• Branch and Bound in Mixed Integer Linear Programming Problems: A Survey of Techniques and Trends
• Dynamic Stratified Contrastive Learning with Upstream Augmentation for MILP Branching
• The SCIP Optimization Suite 10.0
• ReviBranch: Deep Reinforcement Learning for Branch-and-Bound with Revived Trajectories
• Global Nonconvex Optimization with Integer Variables
• Refined bounds for algorithm configuration: The knife-edge of dual class approximability
• Improving Full Strong Branching Decisions by Incorporating Additional Information
• Human-Usable Password Schemas: Beyond Information-Theoretic Security
• Solving Linear Programs with Complementarity Constraints using Branch-and-Cut
• The Vehicle Routing Problem with Transhipment Facilities
• Comparing Neural Network Encodings for Logic-based Explainability