Local branching relaxation heuristics for integer linear programs
From MaRDI portal
Publication:6057251
DOI10.1007/978-3-031-33271-5_7arXiv2212.08183OpenAlexW4377249757MaRDI QIDQ6057251
Taoan Huang, Aaron Ferber, Yuandong Tian, Benoit Steiner, Bistra Dilkina
Publication date: 4 October 2023
Published in: Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.08183
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)
Cites Work
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- RENS. The optimal rounding
- Efficient models for the facility layout problem
- Local branching
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
- Exploring relaxation induced neighborhoods to improve MIP solutions
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Adaptive large neighborhood search for mixed integer programming
- Heuristic search viewed as path finding in a graph
- The Vehicle Routing Problem
- Combinatorial Auctions: A Survey
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- Statistical mechanics of complex networks
- An Exact Approach to the One-Dimensional Facility Layout Problem
- An Automatic Method for Solving Discrete Programming Problems
- Solving Connected Subgraph Problems in Wildlife Conservation
- Rounding and Propagation Heuristics for Mixed Integer Programming
- Mixed Integer Programming: Analyzing 12 Years of Progress
- DINS, a MIP Improvement Heuristic
This page was built for publication: Local branching relaxation heuristics for integer linear programs
