scientific article; zbMATH DE number 6913905

zbMath1392.90084MaRDI QIDQ4577935

Iván Derpich, Juan M. Sepúlveda

Publication date: 6 August 2018

Full work available at URL: https://hrcak.srce.hr/ojs/index.php/crorr/article/view/4552

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

integer programmingbranch-and-bound methodbranching rulealgorithm efficiency

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05)

Uses Software

• PICO
• OR-Library

Cites Work

• Information-theoretic approaches to branching in search
• Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
• On the solution of traveling salesman problems
• Branching rules revisited
• A Computational Study of Search Strategies for Mixed Integer Programming
• Experiments in mixed-integer linear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: