The following pages link to Tabu Search—Part I (Q4018159):
Displaying 50 items.
- Optimisation of gravity-fed water distribution network design: a critical review (Q257205) (← links)
- Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
- A two-stage urban bus stop location model (Q262929) (← links)
- A graph coloring approach to the deployment scheduling and unit assignment problem (Q283268) (← links)
- Applying simulated annealing using different methods for the neighborhood search in forest planning problems (Q297021) (← links)
- Frequency optimization in public transportation systems: formulation and metaheuristic approach (Q299827) (← links)
- Circular coloring of graphs via linear programming and tabu search (Q302132) (← links)
- Multi-start iterated tabu search for the minimum weight vertex cover problem (Q306082) (← links)
- Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem (Q306092) (← links)
- Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
- The multiple vehicle pickup and delivery problem with LIFO constraints (Q319195) (← links)
- Practical solutions for a dock assignment problem with trailer transportation (Q319870) (← links)
- Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) (Q322556) (← links)
- Pro-active real-time routing in applications with multiple request patterns (Q323177) (← links)
- Eidetic wolf search algorithm with a global memory structure (Q323278) (← links)
- Generalized Ramsey numbers through adiabatic quantum optimization (Q331397) (← links)
- A memetic algorithm for the travelling salesperson problem with hotel selection (Q336356) (← links)
- A tabu method for a two-agent single-machine scheduling with deterioration jobs (Q336450) (← links)
- Effect of solution representations on tabu search in scheduling applications (Q336636) (← links)
- Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
- Genetic tabu search for the fuzzy flexible job shop problem (Q337343) (← links)
- The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
- Scatter search with path relinking for the job shop with time lags and setup times (Q337556) (← links)
- Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling (Q337595) (← links)
- On double cycling for container port productivity improvement (Q338901) (← links)
- Variable neighborhood search for location routing (Q339539) (← links)
- Vehicle routing problem with stochastic travel times including soft time windows and service costs (Q339568) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- A new heuristic algorithm for the circular packing problem with equilibrium constraints (Q350917) (← links)
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
- A random sampling approach to worst-case design of structures (Q381813) (← links)
- The linehaul-feeder vehicle routing problem with virtual depots and time windows (Q410539) (← links)
- Multipath adaptive tabu search for a vehicle control problem (Q411085) (← links)
- Hopf bifurcation analysis in a tabu learning neuron model with two delays (Q420218) (← links)
- A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088) (← links)
- Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
- The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
- Constructing \(E(s^2)\)-optimal and minimax-optimal \(k\)-circulant supersaturated designs via multi-objective tabu search (Q434541) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- Similarities between meta-heuristics algorithms and the science of life (Q441019) (← links)
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
- Adaptive conformational sampling based on replicas (Q455720) (← links)
- Hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices (Q462781) (← links)
- A testing based extraction algorithm for identifying significant communities in networks (Q484064) (← links)
- Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
- Local search for Boolean satisfiability with configuration checking and subscore (Q490437) (← links)
- Using local similarity measures to efficiently address approximate graph matching (Q496650) (← links)
- Optimal topological design for distributed estimation over sensor networks (Q497910) (← links)
- A single-machine scheduling with a truncated linear deterioration and ready times (Q497952) (← links)
- GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem (Q503664) (← links)
