Enhancing large neighbourhood search heuristics for Benders’ decomposition

A general enhancement of the Benders’ decomposition (BD) algorithm can be achieved through the improved use of large neighbourhood search heuristics within mixed-integer programming solvers. While mixed-integer programming solvers are endowed with an array of large neighbourhood search heuristics, f...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of heuristics Ročník 27; číslo 4; s. 615 - 648
Hlavný autor:	Maher, Stephen J.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.08.2021 Springer Nature B.V
Predmet:	Algorithms Artificial Intelligence Benchmarks Benders decomposition Calculus of Variations and Optimal Control; Optimization Heuristic Integer programming Management Science Mathematics Mathematics and Statistics Mixed integer Neighborhoods Operations Research Operations Research/Decision Theory Searching Solvers Mixed integer programming Benders’ decomposition Large neighbourhood search Enhancement techniques
ISSN:	1381-1231, 1572-9397
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!