Exploring relaxation induced neighborhoods to improve MIP solutions

2004/05/20 by Emilie Danna, Edward Rothberg, Claude Le Pape · 9 citations
Computer Science · Engineering · #Constraint Satisfaction and Optimization #Vehicle Routing Optimization Methods #Advanced Graph Theory Research

paper · doi:10.1007/s10107-004-0518-7

Cited by

• Using a MIP Solver as a PDHG-Based MIP Heuristic
• Smart Feasibility Pump: Reinforcement Learning for (Mixed) Integer Programming
• Security-Constrained Unit Commitment for Electricity Market: Modeling, Solution Methods, and Future Challenges
• Branch and Bound in Mixed Integer Linear Programming Problems: A Survey of Techniques and Trends
• Prediction and Optimal Scheduling of Advertisements in Linear Television
• GFORS: GPU-Accelerated First-Order Method with Randomized Sampling for Binary Integer Programs
• Joint Routing, Resource Allocation, and Energy Optimization for Integrated Access and Backhaul with Open RAN
• A Frank-Wolfe-based primal heuristic for quadratic mixed-integer optimization
• Relax-and-Cut for Temporal SCUC Decomposition