A recombination‐based matheuristic for mixed integer programming problems with binary variables
From MaRDI portal
Publication:6066716
DOI10.1111/itor.12526MaRDI QIDQ6066716
Eduardo G. Carrano, Felipe Campelo, André L. Maravilha
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12526
90-XX: Operations research, mathematical programming
Cites Work
- A survey of very large-scale neighborhood search techniques
- RENS. The optimal rounding
- Local branching
- Exploring relaxation induced neighborhoods to improve MIP solutions
- The feasibility pump
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
- The R Book
- DINS, a MIP Improvement Heuristic
- Handbook of metaheuristics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item