Tabu search
From MaRDI portal
Cited in
(only showing first 100 items - show all)- An algorithm for the generalized quadratic assignment problem
- Solving weighted MAX-SAT via global equilibrium search
- A ring-mesh topology design problem for optical transport networks
- A route set construction algorithm for the transit network design problem
- Analysis of new variable selection methods for discriminant analysis
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
- Revisiting constraint-directed search
- Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem
- A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization
- A survey on metaheuristics for stochastic combinatorial optimization
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Adaptive granular local search heuristic for a dynamic vehicle routing problem
- The single-finger keyboard layout problem
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow
- A robust and efficient algorithm for planar competitive location problems
- Combined location-routing problems -- a neural network approach
- Optimal location with equitable loads
- The multiple server center location problem
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
- MILP approach to pattern generation in logical analysis of data
- Two aspects of optimal diet determination for pig production: Efficiency of solution and incorporation of cost variation
- A tabu search approach for the minimum sum-of-squares clustering problem
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies
- A hybrid meta-heuristic for global optimisation using low-discrepancy sequences of points
- GRASP and path relinking for the max-min diversity problem
- A solution method for a car fleet management problem with maintenance constraints
- AEGIS---attribute experimentation guiding improvement searches
- A cross entropy based algorithm for reliability problems
- A tabu search algorithm for scheduling pharmaceutical packaging operations
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
- A search space ``cartography for guiding graph coloring heuristics
- Solving a manpower scheduling problem for airline catering using metaheuristics
- An effective local search for the maximum clique problem
- Exact and heuristic methods for the selective maintenance problem
- An integrated tabu search algorithm for the lot streaming problem in job shops
- A variable selection method based on Tabu search for logistic regression models
- Heuristic algorithms for the multi-depot ring-star problem
- Feasibility pump 2.0
- Solving a minimum-power covering problem with overlap constraint for cellular network design
- Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis
- An SA/TS mixture algorithm for the scheduling tardiness problem
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- Massively parallel analog tabu search using neural networks applied to simple plant location problems
- The job shop scheduling problem: Conventional and new solution techniques
- General local search methods
- The life span method -- a new variant of local search
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- A fast tabu search algorithm for the permutation flow-shop problem
- An efficient tabu search procedure for the p-median problem
- Planning models for freight transportation
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- Driving tabu search with case-based reasoning
- A two-machine permutation flow shop scheduling problem with buffers
- CDT
- A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
- Heuristic concentration and tabu search: A head to head comparison
- Some personal views on the current state and the future of locational analysis
- Multi-resource shop scheduling with resource flexibility
- Location of hubs in a competitive environment
- A tabu search approach for the flow shop scheduling problem
- Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study
- Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
- EOlib
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
- Heuristic and exact methods for the cutting sequencing problem
- Modeling and solving a real-life assignment problem at universities
- GLOB
- Hyperheuristics
- iOpt
- Isolde
- A parallel tabu search algorithm for large traveling salesman problems
- A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits
- Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems
- Using the tabu search method for the distribution of supplies in a hospital
- Combinatorial optimization techniques for spacecraft scheduling automation
- Optimization by ghost image processes in neural networks
- A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows
- Extensions of a tabu search adaptation to the quadratic assignment problem
- Applying tabu search with influential diversification to multiprocessor scheduling
- A study of diversification strategies for the quadratic assignment problem
- Genetic algorithms and tabu search: Hybrids for optimization
- ParadisEO-MOEO
- The depth and width of local minima in discrete solution spaces
- PariTOP
- PSPLIB
- emili
- ALNS
- QAPLIB
- DeepSynth
- PyBNesian
- Construction of exact D-optimal designs by tabu search
- SeaPearl
- Graph domination, tabu search and the football pool problem
- SDSAT
- On block-transitive designs with affine automorphism group
- Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
This page was built for software: Tabu search
