Pages that link to "Item:Q2489139"

The following pages link to Variable neighborhood search and local branching (Q2489139):

Displaying 50 items.

• Integer programming techniques for the nurse rostering problem (Q284423) (← links)
• Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
• A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
• Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
• A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← links)
• Model-based automatic neighborhood design by unsupervised learning (Q337347) (← links)
• A recipe for finding good solutions to MINLPs (Q384810) (← links)
• Adapting derivative free optimization methods to engineering models with discrete variables (Q400044) (← links)
• A variable neighborhood search based matheuristic for nurse rostering problems (Q475191) (← links)
• An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581) (← links)
• Shift-and-propagate (Q524884) (← links)
• Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (Q683326) (← links)
• A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
• RENS. The optimal rounding (Q744216) (← links)
• General variable neighborhood search for the continuous optimization (Q932193) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Solving multiple scenarios in a combinatorial auction (Q1017447) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• Hybridization of very large neighborhood search for ready-mixed concrete delivery problems (Q1038296) (← links)
• A local branching heuristic for the capacitated fixed-charge network design problem (Q1038297) (← links)
• Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants (Q1040968) (← links)
• Feasibility pump 2.0 (Q1043854) (← links)
• MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
• Solving MIPs via scaling-based augmentation (Q1662107) (← links)
• A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges (Q1687653) (← links)
• Adaptive kernel search: a heuristic for solving mixed integer linear programs (Q1694819) (← links)
• A hybrid primal heuristic for finding feasible solutions to mixed integer programs (Q1695014) (← links)
• An ILP-based local search procedure for the VRP with pickups and deliveries (Q1698289) (← links)
• Variable neighborhood search: basics and variants (Q1707084) (← links)
• Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments (Q1707498) (← links)
• A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem (Q1749483) (← links)
• A local branching heuristic for the open pit mine production scheduling problem (Q1752798) (← links)
• A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine (Q1762139) (← links)
• Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves (Q1785252) (← links)
• On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs (Q2064299) (← links)
• Advancing local search approximations for multiobjective combinatorial optimization problems (Q2125231) (← links)
• A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance (Q2147013) (← links)
• Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
• New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
• Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
• Repairing MIP infeasibility through local branching (Q2459381) (← links)
• A variable neighborhood search branching for the electric vehicle routing problem with time windows (Q2631269) (← links)
• Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching (Q2631277) (← links)
• Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs (Q2654395) (← links)
• In memory of Professor Nenad Mladenović (1951--2022) (Q2677361) (← links)
• Packing Unit Spheres into a Cube Using VNS (Q2840774) (← links)
• Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility (Q2883646) (← links)
• Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
• An Investigation on Compound Neighborhoods for VRPTW (Q2980168) (← links)
• A variable neighbourhood search algorithm for the flexible job-shop scheduling problem (Q3163164) (← links)