Matheuristics: survey and synthesis

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

Full description

Saved in:
Bibliographic Details
Published in:International transactions in operational research 2023-11, Vol.30 (6), p.2840-2866
Main Authors: Boschetti, Marco A., Letchford, Adam N., Maniezzo, Vittorio
Format: Article
Language:English
Subjects:
Combinatorial analysis
combinatorial optimisation
dual ascent
Heuristic
heuristics
Integer programming
Lagrangian relaxation
Lower bounds
matheuristics
Operations research
Optimization
Optimization algorithms
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0969-6016
1475-3995
DOI:10.1111/itor.13301