EconPapers    
Economics at your fingertips  
 

A Multi-reference Relaxation Enforced Neighborhood Search Heuristic in SCIP

Suresh Bolusani (), Gioni Mexi (), Mathieu Besançon () and Mark Turner ()
Additional contact information
Suresh Bolusani: Zuse Institute Berlin
Gioni Mexi: Zuse Institute Berlin
Mathieu Besançon: Grenoble Alpes University, Inria, LIG
Mark Turner: Zuse Institute Berlin

A chapter in Operations Research Proceedings 2024, 2025, pp 421-427 from Springer

Abstract: Abstract This paper proposes and evaluates a Multi-reference Relaxation Enforced Neighborhood Search (MRENS) heuristic within the SCIP solver. This study marks the first integration and evaluation of MRENS in a full-fledged MILP solver, specifically coupled with the recently-introduced Lagromory separator for generating multiple reference solutions. Computational experiments on the MIPLIB 2017 benchmark set show that MRENS, with multiple reference solutions, improves the solver’s ability to find higher-quality feasible solutions compared to single-reference approaches. This study highlights the potential of multi-reference heuristics in enhancing primal heuristics in MILP solvers.

Keywords: Mixed-integer optimization; Heuristics; SCIP; MRENS (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnopch:978-3-031-92575-7_60

Ordering information: This item can be ordered from
http://www.springer.com/9783031925757

DOI: 10.1007/978-3-031-92575-7_60

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-10-01
Handle: RePEc:spr:lnopch:978-3-031-92575-7_60