Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
DOI10.1016/J.EJOR.2005.02.051zbMATH Open1131.90076OpenAlexW1995895592MaRDI QIDQ858332FDOQ858332
Authors: Iván Derpich, Jorge R. Vera 
Publication date: 9 January 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/177802
Recommendations
- Accelerating the B\&B algorithm for integer programming based on flatness information: an approach applied to the multidimensional knapsack problem
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
- Basis reduction and the complexity of branch-and-bound
- scientific article; zbMATH DE number 3908168
- Branching rules revisited
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- A polynomial invariant for knots via von Neumann algebras
- A Computational Study of Search Strategies for Mixed Integer Programming
- An Automatic Method of Solving Discrete Programming Problems
- Geometric algorithms and combinatorial optimization.
- Integer Programming with a Fixed Number of Variables
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- A tree-search algorithm for mixed integer programming problems
- Experiments in mixed-integer linear programming
- Branch and Bound Methods for Mathematical Programming Systems
- On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
- The shortest vector in a lattice is hard to approximate to within some constant
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- Investigation of some branch and bound strategies for the solution of mixed integer linear programs
- Experiments in mixed-integer linear programming using pseudo-costs
- Title not available (Why is that?)
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
Cited In (10)
- Thinner is not always better: cascade knapsack problems
- Determining initial bound by ``ray-method in branch and bound procedure
- Accelerating the B\&B algorithm for integer programming based on flatness information: an approach applied to the multidimensional knapsack problem
- Using modifications to Grover's search algorithm for quantum global optimization
- Improved branching disjunctions for branch-and-bound: an analytic center approach
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
- Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis
- The ray-method: theoretical background and computational results
- Stochastic level-value approximation for quadratic integer convex programming
- A possible way to reduce degeneracy in integer programming computations
Uses Software
This page was built for publication: Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858332)
