The following pages link to Variable neighborhood search (Q1374041):
Displayed 50 items.
- Variable neighborhood search for the maximum clique (Q705505) (← links)
- Heuristics for the multi-period orienteering problem with multiple time windows (Q732904) (← links)
- Heuristic procedures for solving the discrete ordered median problem (Q816415) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- A restarted and modified simplex search for unconstrained optimization (Q833553) (← links)
- Graph colouring approaches for a satellite range scheduling problem (Q835607) (← links)
- A survey of search methodologies and automated system development for examination timetabling (Q835639) (← links)
- An optimization approach for communal home meal delivery service: A case study (Q837090) (← links)
- New neighborhood structures for the double traveling salesman problem with multiple stacks (Q839902) (← links)
- Delivery strategies for blood products supplies (Q841585) (← links)
- A multi-objective evolutionary algorithm for examination timetabling (Q842554) (← links)
- Classification of applied methods of combinatorial optimization (Q844352) (← links)
- Principles for the design of large neighborhood search (Q846169) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
- Experimental investigation of heuristics for resource-constrained project scheduling: an update (Q858327) (← links)
- Heuristics for the mirrored traveling tournament problem (Q863992) (← links)
- Scheduling periodic customer visits for a traveling salesperson (Q863999) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- Solving the unconstrained optimization problem by a variable neighborhood search (Q864633) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- Self-organizing feature maps for the vehicle routing problem with backhauls (Q880535) (← links)
- An effective VNS for the capacitated \(p\)-median problem (Q932177) (← links)
- Model and algorithm for inventory/routing decision in a three-echelon logistics system (Q932178) (← links)
- Variable neighborhood search for minimum cost berth allocation (Q932179) (← links)
- A general vehicle routing problem (Q932181) (← links)
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph (Q932184) (← links)
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem (Q932185) (← links)
- Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks (Q932187) (← links)
- Combining VNS with constraint programming for solving anytime optimization problems (Q932188) (← links)
- General variable neighborhood search for the continuous optimization (Q932193) (← links)
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search (Q933803) (← links)
- A modified VNS metaheuristic for max-bisection problems (Q939544) (← links)
- Exact \(L_{2}\)-norm plane separation (Q941041) (← links)
- Design of hybrids for the minimum sum-of-squares clustering problem (Q951921) (← links)
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311) (← links)
- Local and variable neighborhood search for the \(k\) -cardinality subgraph problem (Q953319) (← links)
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem (Q953320) (← links)
- A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation (Q953839) (← links)
- A memetic algorithm for the flexible flow line scheduling problem with processor blocking (Q954039) (← links)
- Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem (Q954251) (← links)
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number (Q955318) (← links)
- Variable space search for graph coloring (Q955321) (← links)
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510) (← links)
- Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
- A population-based variable neighborhood search for the single machine total weighted tardiness problem (Q1001005) (← links)
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems (Q1010274) (← links)
- Allocation search methods for a generalized class of location-allocation problems (Q1011223) (← links)
- The traveling purchaser problem with budget constraint (Q1013406) (← links)