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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of heuristics Vol. 27; no. 4; pp. 615 - 648
Main Author:	Maher, Stephen J.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2021 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!