A learn‐and‐construct framework for general mixed‐integer programming problems

DOI10.1111/itor.12578OpenAlexW2884674635WikidataQ129460414 ScholiaQ129460414MaRDI QIDQ6066679

Tommaso Adamo, Emanuela Guerriero, Gianpaolo Ghiani, Emanuele Manni

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

zbMATH Keywords

optimizationheuristicsmixed integer programmingunsupervised learningfeasible solution

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems ⋮ Learn to decompose multiobjective optimization models for large‐scale networks

Cites Work

• Unnamed Item
• Model-based automatic neighborhood design by unsupervised learning
• Boosting the feasibility pump
• Feasibility pump 2.0
• GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
• Local branching
• MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
• Exploring relaxation induced neighborhoods to improve MIP solutions
• A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
• A feasibility pump heuristic for general mixed-integer problems
• Improving the feasibility pump
• The feasibility pump
• An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• ParamILS: An Automatic Algorithm Configuration Framework
• TSPLIB—A Traveling Salesman Problem Library
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• A New Approach to the Feasibility Pump in Mixed Integer Programming

This page was built for publication: A learn‐and‐construct framework for general mixed‐integer programming problems