The following pages link to Tabu search (Q20565):
Displaying 50 items.
- A simple and effective algorithm for the MaxMin diversity problem (Q646655) (← links)
- A filter-and-fan approach to the 2D HP model of the protein folding problem (Q646723) (← links)
- Risk approaches for delivering disaster relief supplies (Q647529) (← links)
- A metamodel-assisted evolutionary algorithm for expensive optimization (Q651911) (← links)
- A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm (Q652663) (← links)
- Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
- Applying the corridor method to a blocks relocation problem (Q657049) (← links)
- Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
- A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations (Q657059) (← links)
- Political districting: From classical models to recent approaches (Q657583) (← links)
- A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices (Q658141) (← links)
- Continuation methods for approximate large scale object sequencing (Q669313) (← links)
- Parameter tuning for local-search-based matheuristic methods (Q680781) (← links)
- Modeling and control of switching max-plus-linear systems with random and deterministic switching (Q692382) (← links)
- Design of computer experiments: space filling and beyond (Q693293) (← links)
- Consistent neighborhood search for combinatorial optimization (Q693704) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- Tabu search algorithms for water network optimization (Q703933) (← links)
- Activity consolidation to improve responsiveness (Q706959) (← links)
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows (Q707148) (← links)
- A metaheuristic for stochastic service network design (Q707730) (← links)
- Solving the musical orchestration problem using multiobjective constrained optimization with a genetic local search approach (Q707734) (← links)
- Two-level evolutionary approach to the survivable mesh-based transport network topological design (Q707738) (← links)
- A library of local search heuristics for the vehicle routing problem (Q708775) (← links)
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem (Q709119) (← links)
- An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows (Q709143) (← links)
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness (Q711284) (← links)
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite (Q711387) (← links)
- The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model (Q712692) (← links)
- The flexible blocking job shop with transfer and set-up times (Q719021) (← links)
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions (Q725777) (← links)
- Construction and improvement algorithms for dispersion problems (Q726217) (← links)
- Comparative analysis of the machine repair problem with imperfect coverage and service pressure condition (Q727280) (← links)
- An efficient heuristic for reliability design optimization problems (Q732879) (← links)
- Algorithms for solving minimax scheduling problem (Q734231) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- A black-box scatter search for optimization problems with integer variables (Q742141) (← links)
- Integrated production and distribution scheduling with lifespan constraints (Q744659) (← links)
- Transshipment service through crossdocks with both soft and hard time windows (Q763197) (← links)
- Parallelization strategies for rollout algorithms (Q812417) (← links)
- An extended ant colony algorithm and its convergence analysis (Q812977) (← links)
- Problem difficulty for tabu search in job-shop scheduling (Q814423) (← links)
- Looking ahead with the pilot method (Q816423) (← links)
- Evolutionary approaches to DNA sequencing with errors (Q817123) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
