In integer programming and combinatorial optimisation, people use the term matheuristics to refer to methods that are heuristic in nature but draw on concepts from the literature on exact methods. We survey the literature on this topic, with a particular emphasis on matheuristics that yield both primal and dual bounds (i.e., upper and lower bounds in the case of a minimisation problem). We also make some comments about possible future developments.
Matheuristics: survey and synthesis
Boschetti, Marco A.;Maniezzo, Vittorio
2023
Abstract
In integer programming and combinatorial optimisation, people use the term matheuristics to refer to methods that are heuristic in nature but draw on concepts from the literature on exact methods. We survey the literature on this topic, with a particular emphasis on matheuristics that yield both primal and dual bounds (i.e., upper and lower bounds in the case of a minimisation problem). We also make some comments about possible future developments.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
28-ITOR-Matheuristics-survey-and-synthesis.pdf
accesso aperto
Tipo:
Versione (PDF) editoriale
Licenza:
Licenza per Accesso Aperto. Creative Commons Attribuzione (CCBY)
Dimensione
831.74 kB
Formato
Adobe PDF
|
831.74 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.