Accelerating the B\&B algorithm for integer programming based on flatness information: an approach applied to the multidimensional knapsack problem
From MaRDI portal
Publication:4577935
zbMATH Open1392.90084MaRDI QIDQ4577935FDOQ4577935
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
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
Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10)
Cites Work
- PICO: An object-oriented framework for parallel branch and bound
- A Computational Study of Search Strategies for Mixed Integer Programming
- Branching rules revisited
- Title not available (Why is that?)
- On the solution of traveling salesman problems
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
- Title not available (Why is that?)
- Experiments in mixed-integer linear programming
- Title not available (Why is that?)
- Information-theoretic approaches to branching in search
Cited In (1)
Uses Software
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)
