Accelerating the B\&B algorithm for integer programming based on flatness information: an approach applied to the multidimensional knapsack problem

MaRDI QIDQ4577935zbMATH OpenFDO

Authors 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

zbMATH Keywords

integer programmingbranching rulebranch-and-bound methodalgorithm efficiency

Mathematics Subject Classification ID

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

Recommendations

• Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
• Thinner is not always better: cascade knapsack problems
• Bounds on the size of branch-and-bound proofs for integer knapsacks
• On The Strength Of Relaxations Of Multidimensional Knapsack Problems
• A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints

Cites work

• scientific article; zbMATH DE number 7124428 (Why is no real title available?)
• scientific article; zbMATH DE number 3301975 (Why is no real title available?)
• scientific article; zbMATH DE number 3046578 (Why is no real title available?)
• A Computational Study of Search Strategies for Mixed Integer Programming
• Branching rules revisited
• Experiments in mixed-integer linear programming
• Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
• Information-theoretic approaches to branching in search
• On the solution of traveling salesman problems
• PICO: An object-oriented framework for parallel branch and bound

Cited in

(2)

• Thinner is not always better: cascade knapsack problems
• Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information

Describes a project that uses

Uses Software

• OR-Library
• PICO

This page was built for publication: Accelerating the B\&B algorithm for integer programming based on flatness information: an approach applied to the multidimensional knapsack problem

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