Guest Editors: Claudia Archetti, David Pisinger, M.Grazia Speranza
In spite of the progress in information technology and the advance in exact methods for the solution of combinatorial optimization and mixed integer linear programming problems, heuristics remain necessary to obtain high quality solutions for computationally hard problems. The availability of powerful commercial software has created new opportunities in the design of heuristics, generating a new class of algorithms that combine classical heuristic and metaheuristic schemes with MIP strategies and software. Although recent, this research direction has already generated a rich body of literature. The heuristics in this class are presented under different names, optimization-based heuristics, heuristics based on mathematical programming, hybrid heuristics, matheuristics. We use this latter name to identify all heuristics in the class.
The goal of this special issue is to collect high-quality papers on matheuristics for the solution of combinatorial optimization and mixed integer linear programming problems. We encourage submission of papers that are surveys or present advances in the theory, practice and application of matheuristics. Applied papers should, however, contain elements that can be generalized to other problems.
Submitted papers should not have been published previously or be under consideration for publication elsewhere. Please submit your manuscripts through the EJCO online submission tool.
For any further information, please contact the guest editors.
This work is licensed under a Creative Commons Attribution-ShareAlike 3.0 International License and the GNU Free Documentation License (unversioned, with no invariant sections, front-cover texts, or back-cover texts).