2010
DOI: 10.1007/s10288-010-0140-x
|View full text |Cite
|
Sign up to set email alerts
|

Enhanced mixed integer programming techniques and routing problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 116 publications
(270 reference statements)
0
1
0
Order By: Relevance
“…Cutting planes Throughout the search, and in particular at the root node, MIP solvers generate cutting planes to tighten the LP relaxation, improve the dual bound, and reduce the number of fractional variables. For an overview on cuts in MIP, see [20,27,30]. Globally valid cutting planes, as those separated at the root, can be either directly added to the current LP relaxation or added to a so-called cut pool, from which they can be separated again on demand, e.g., at subsequent nodes [25].…”
Section: Global Informationmentioning
confidence: 99%
“…Cutting planes Throughout the search, and in particular at the root node, MIP solvers generate cutting planes to tighten the LP relaxation, improve the dual bound, and reduce the number of fractional variables. For an overview on cuts in MIP, see [20,27,30]. Globally valid cutting planes, as those separated at the root, can be either directly added to the current LP relaxation or added to a so-called cut pool, from which they can be separated again on demand, e.g., at subsequent nodes [25].…”
Section: Global Informationmentioning
confidence: 99%