Pages that link to "Item:Q5937708"

The following pages link to Variable neighborhood search: Principles and applications (Q5937708):

Displaying 50 items.

• Computing the metric dimension of graphs by genetic algorithms (Q849088) (← links)
• Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery (Q850302) (← links)
• Detailed layout planning for irregularly-shaped machines with transportation path design (Q856265) (← 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)
• Learning multicriteria fuzzy classification method PROAFTN from data (Q868128) (← links)
• Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach (Q883312) (← links)
• An exact method for the discrete \((r|p)\)-centroid problem (Q887194) (← links)
• A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines (Q887202) (← links)
• A multi-start variable neighborhood search for solving the single path multicommodity flow problem (Q902982) (← 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)
• Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph (Q932184) (← links)
• General variable neighborhood search for the continuous optimization (Q932193) (← links)
• Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem (Q933505) (← links)
• A discrete particle swarm optimization for lot-streaming flowshop scheduling problem (Q933507) (← links)
• Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search (Q933803) (← links)
• Comparison and hybridization of crossover operators for the nurse scheduling problem (Q940898) (← links)
• Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem (Q941025) (← links)
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311) (← links)
• A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows (Q953316) (← 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)
• 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)
• Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
• A survey of automated conjectures in spectral graph theory (Q962119) (← links)
• Honey bees mating optimization algorithm for large scale vehicle routing problems (Q968387) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (Q976040) (← links)
• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem (Q976311) (← links)
• Hybrid variable neighbourhood approaches to university exam timetabling (Q976395) (← links)
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
• A hybrid scatter search heuristic for personalized crew rostering in the airline industry (Q976415) (← links)
• Nordhaus-Gaddum relations for proximity and remoteness in graphs (Q988253) (← links)
• Mathematical models and solution methods for optimal container terminal yard layouts (Q989631) (← links)
• Attraction probabilities in variable neighborhood search (Q989828) (← links)
• Parallel machine scheduling with precedence constraints and setup times (Q991370) (← links)
• Discrepancy search for the flexible job shop scheduling problem (Q991381) (← links)
• A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application (Q991831) (← links)
• Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
• A hybrid heuristic algorithm for the open-pit-mining operational planning problem (Q992718) (← 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)
• Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
• A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization (Q1015314) (← links)
• A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)