Variable neighborhood search and local branching
From MaRDI portal
Publication:2489139
DOI10.1016/j.cor.2005.02.033zbMath1086.90042OpenAlexW2112496246WikidataQ57254152 ScholiaQ57254152MaRDI QIDQ2489139
Pierre Hansen, Dragan Urošević, Nenad Mladenović
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
Related Items
Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility, Advancing local search approximations for multiobjective combinatorial optimization problems, A variable neighbourhood search algorithm for the flexible job-shop scheduling problem, Integer programming techniques for the nurse rostering problem, A variable neighborhood search branching for the electric vehicle routing problem with time windows, Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching, New convergent heuristics for 0-1 mixed integer programming, Heuristic approaches for biobjective mixed 0-1 integer linear programming problems, A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance, A model for clustering data from heterogeneous dissimilarities, Variable neighborhood search for the pharmacy duty scheduling problem, A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion, Model-based automatic neighborhood design by unsupervised learning, MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration, Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs, Solving MIPs via scaling-based augmentation, Mathematical programming based heuristics for the 0--1 MIP: a survey, A recipe for finding good solutions to MINLPs, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect, Adapting derivative free optimization methods to engineering models with discrete variables, In memory of Professor Nenad Mladenović (1951--2022), A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges, Adaptive kernel search: a heuristic for solving mixed integer linear programs, A hybrid primal heuristic for finding feasible solutions to mixed integer programs, Hybridizations of evolutionary algorithms with large neighborhood search, Variable neighborhood search: the power of change and simplicity, Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows, An ILP-based local search procedure for the VRP with pickups and deliveries, Variable neighborhood search: basics and variants, Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments, An Investigation on Compound Neighborhoods for VRPTW, A variable neighborhood search based matheuristic for nurse rostering problems, General variable neighborhood search for the continuous optimization, Repairing MIP infeasibility through local branching, An algorithm for approximating the Pareto set of the multiobjective set covering problem, A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs, A local branching heuristic for the open pit mine production scheduling problem, Shift-and-propagate, A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine, Variable neighbourhood search: methods and applications, A computational study of parametric tabu search for 0-1 mixed integer programs, Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves, Structure-driven fix-and-propagate heuristics for mixed integer programming, RENS. The optimal rounding, Solving multiple scenarios in a combinatorial auction, On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs, 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, Packing Unit Spheres into a Cube Using VNS, Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants, Feasibility pump 2.0
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
