2006
DOI: 10.1016/j.ejor.2005.02.051
|View full text |Cite
|
Sign up to set email alerts
|

Improving the efficiency of the Branch and Bound algorithm for integer programming based on “flatness” information

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
17
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(17 citation statements)
references
References 20 publications
0
17
0
Order By: Relevance
“…In their work, the branching rule utilizes the eigenvalues of a matrix corresponding to an inscribed Dikin ellipsoid [2]. However, experimenting with the method in [1] shows that is not adequately efficient as it requires long CPU processing times in calculating the center point of the ellipsoid and the eigenvalues of the matrix. The new proposed method uses the columns of matrix A.…”
Section: The Proposed Branching Rule: Flatness IImentioning
confidence: 99%
See 3 more Smart Citations
“…In their work, the branching rule utilizes the eigenvalues of a matrix corresponding to an inscribed Dikin ellipsoid [2]. However, experimenting with the method in [1] shows that is not adequately efficient as it requires long CPU processing times in calculating the center point of the ellipsoid and the eigenvalues of the matrix. The new proposed method uses the columns of matrix A.…”
Section: The Proposed Branching Rule: Flatness IImentioning
confidence: 99%
“…viii) The flatness rule (FLAT) is the original rule developed in [1]. Here, ellipses based on a logarithmic barrier function are used for the polyhedron.…”
Section: Branching Rulesmentioning
confidence: 99%
See 2 more Smart Citations
“…It is also known, from a result of Banaszczyk et al [1999], that if P ∩ Z n is empty, then w(P) ≤ Cn 3 2 , where C is a constant. Derpich and Vera [2006] approximate the direction of the minimum width in order to assign priorities for branching on variables and use this to select variable disjunctions.…”
Section: Minimizing Widthmentioning
confidence: 99%