2023
DOI: 10.1007/s40305-023-00493-1
|View full text |Cite
|
Sign up to set email alerts
|

MILP Acceleration: A Survey from Perspectives of Simplex Initialization and Learning-Based Branch and Bound

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 54 publications
0
2
0
Order By: Relevance
“…So, we cannot prove the uniqueness of the solution for the MILP model constructed in this article. Just as Huang et al [47] proved in their paper that MILP is an NP hard problem with multiple solutions, the original problem needs to be divided into several subproblems for solving.…”
Section: Basic Modelmentioning
confidence: 99%
“…So, we cannot prove the uniqueness of the solution for the MILP model constructed in this article. Just as Huang et al [47] proved in their paper that MILP is an NP hard problem with multiple solutions, the original problem needs to be divided into several subproblems for solving.…”
Section: Basic Modelmentioning
confidence: 99%
“…This approach markedly reduces the computational time typically consumed by numerous repeated search sequences after each iteration. For further exploration, refer to [12][13][14][15][16][17][18][19][20][21][22]. Notably, the structural underpinnings of most of these methods are rooted in negative variables.…”
mentioning
confidence: 99%