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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of heuristics Ročník 28; číslo 3; s. 329 - 350
Hlavní autori:	Rodrigues, Filipe, Agra, Agostinho, Hvattum, Lars Magnus, Requejo, Cristina
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.06.2022 Springer Nature B.V
Predmet:	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
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!