Experiments in mixed-integer linear programming

1971/12/01 by M. Benichou, J. M. Gauthier, P. Girodet +4 · 8 citations
Engineering · Mathematics · Decision Sciences · #Optimization and Mathematical Programming #Advanced Optimization Algorithms Research #Multi-Criteria Decision Making

paper · doi:10.1007/bf01584074

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