Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information
type: Item
instance of: scholarly article
title: Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information
zbMATH Open document ID: 1131.90076
author: Iván Derpich
author: Jorge R. Vera
published in: European Journal of Operational Research
publication date: 2007-01-09T00:00:00Z
full work available at URL: http://hdl.handle.net/10533/177802
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5082780
zbMATH Keywords: discrete optimization
zbMATH Keywords: Branch and Bound
describes a project that uses: TOMLAB
MaRDI profile type: Publication
OpenAlex ID: W1995895592
cites work: Experiments in mixed-integer linear programming
cites work: Branch and Bound Methods for Mathematical Programming Systems
cites work: Q4132250
cites work: A tree-search algorithm for mixed integer programming problems
cites work: Practical Solution of Large Mixed Integer Programming Problems with Umpire
cites work: On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
cites work: Experiments in mixed-integer linear programming using pseudo-costs
cites work: Integer Programming Algorithms: A Framework and State-of-the-Art Survey
cites work: Geometric algorithms and combinatorial optimization.
cites work: A polynomial invariant for knots via von Neumann algebras
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: Integer Programming with a Fixed Number of Variables
cites work: A Computational Study of Search Strategies for Mixed Integer Programming
cites work: Q3745276
cites work: The shortest vector in a lattice is hard to approximate to within some constant
cites work: Investigation of some branch and bound strategies for the solution of mixed integer linear programs
cites work: Q4324980
cites work: Incorporating Condition Measures into the Complexity Theory of Linear Programming
cites work: Q4054818
DOI: 10.1016/J.EJOR.2005.02.051
description: scientific article; zbMATH DE number 5082780