Weighted iterated local branching for mathematical programming problems with binary variables

Local search algorithms are frequently used to handle complex optimization problems involving binary decision variables. One way of implementing a local search procedure is by using a mixed-integer programming solver to explore a neighborhood defined through a constraint that limits the number of bi...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of heuristics Vol. 28; no. 3; pp. 329 - 350
Main Authors:	Rodrigues, Filipe, Agra, Agostinho, Hvattum, Lars Magnus, Requejo, Cristina
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.06.2022 Springer Nature B.V
Subjects:	Artificial Intelligence Calculus of Variations and Optimal Control; Optimization Heuristic Integer programming Iterative methods Management Science Mathematical programming Mathematics Mathematics and Statistics Mixed integer Operations Research Operations Research/Decision Theory Optimization Search algorithms Solvers Matheuristic Neighborhood search Mixed-integer programming Boolean optimization
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!