The following pages link to Variable neighborhood search (Q1374041):
Displaying 50 items.
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- A survey of recent research on location-routing problems (Q296678) (← links)
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem (Q296680) (← links)
- A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
- A hybrid algorithm based on variable neighbourhood for the strip packing problem (Q306099) (← links)
- Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem (Q309064) (← links)
- An integer programming approach to the multimode resource-constrained multiproject scheduling problem (Q310345) (← links)
- Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks (Q310353) (← links)
- Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics (Q315502) (← links)
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints (Q319021) (← links)
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints (Q319206) (← links)
- An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints (Q322469) (← links)
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container (Q322528) (← links)
- The bipartite quadratic assignment problem and extensions (Q322542) (← links)
- Global optimization using \(q\)-gradients (Q322763) (← links)
- Nested general variable neighborhood search for the periodic maintenance problem (Q322899) (← links)
- A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
- A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
- A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem (Q324311) (← links)
- Heuristics for the traveling repairman problem with profits (Q336352) (← links)
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357) (← links)
- A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem (Q336415) (← links)
- Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
- Minimising maximum response time (Q336510) (← links)
- Single string planning problem arising in liner shipping industries: a heuristic approach (Q336521) (← links)
- Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks (Q336554) (← links)
- A meta-heuristic algorithm for the fuzzy assembly line balancing type-E problem (Q336695) (← links)
- Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem (Q336737) (← links)
- A two-stage approach to the orienteering problem with stochastic weights (Q336923) (← links)
- Location-arc routing problem: heuristic approaches and test instances (Q336937) (← links)
- A nested heuristic for parameter tuning in support vector machines (Q336941) (← links)
- Two metaheuristic approaches for solving multidimensional two-way number partitioning problem (Q336995) (← links)
- Minimizing the total completion time in a distributed two stage assembly system with setup times (Q337027) (← links)
- A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department (Q337117) (← links)
- Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
- A high performing metaheuristic for multi-objective flowshop scheduling problem (Q337199) (← links)
- DE-VNS: self-adaptive differential evolution with crossover neighborhood search for continuous global optimization (Q337202) (← links)
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation (Q337206) (← links)
- A variable neighborhood search particle filter for bearings-only target tracking (Q337209) (← links)
- Variable neighborhood search based algorithms for high school timetabling (Q337210) (← links)
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- A global optimisation approach for parameter estimation of a mixture of double Pareto lognormal and lognormal distributions (Q337215) (← links)
- Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search (Q337219) (← links)
- Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach (Q337222) (← links)
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← links)
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows (Q337225) (← links)
- Variable neighborhood search for the workload balancing problem in service enterprises (Q337226) (← links)
- A two phase variable neighborhood search for the multi-product inventory routing problem (Q337230) (← links)
