Variable neighborhood search and local branching
From MaRDI portal
Publication:2489139
DOI10.1016/j.cor.2005.02.033zbMath1086.90042WikidataQ57254152 ScholiaQ57254152MaRDI QIDQ2489139
Pierre Hansen, Nenad Mladenović, Dragan Urošević
Publication date: 16 May 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.02.033
90C09: Boolean programming
Related Items
A computational study of parametric tabu search for 0-1 mixed integer programs, General variable neighborhood search for the continuous optimization, Variable neighbourhood search: methods and applications, Solving multiple scenarios in a combinatorial auction, Variable neighbourhood search: Methods and applications, Hybridization of very large neighborhood search for ready-mixed concrete delivery problems, A local branching heuristic for the capacitated fixed-charge network design problem, Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants, Feasibility pump 2.0, New convergent heuristics for 0-1 mixed integer programming, Repairing MIP infeasibility through local branching, Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs, A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
Uses Software
Cites Work
- Unnamed Item
- General purpose heuristics for integer programming. I
- General purpose heuristics for integer programming. II
- Variable neighborhood search
- Local branching
- Solving zero-one mixed integer programming problems using tabu search
- Pivot and shift -- a mixed integer programming heuristic
- A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
- Pivot and Complement–A Heuristic for 0-1 Programming
- Variable Neighborhood Search
- Handbook of metaheuristics
- Variable neighborhood search: Principles and applications
