The following pages link to Tabu Search—Part II (Q4021362):
Displaying 50 items.
- The impact of operations redesign on the safety stock investment in supply chains (Q955700) (← links)
- Discrete support vector decision trees via tabu search (Q957011) (← links)
- Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times (Q958443) (← links)
- Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment (Q960116) (← links)
- Prototype selection algorithms for distributed learning (Q962819) (← links)
- Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions (Q967212) (← links)
- Bounds for short covering codes and reactive tabu search (Q968171) (← links)
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649) (← links)
- Minimizing total completion time in two-machine flow shops with exact delays (Q1000994) (← links)
- Analysis of new variable selection methods for discriminant analysis (Q1010495) (← links)
- Developing work schedules for an inter-city transit system with multiple driver types and fleet types (Q1011229) (← links)
- The single-finger keyboard layout problem (Q1025249) (← links)
- Complete local search with limited memory algorithm for no-wait job shops to minimize makespan (Q1026757) (← links)
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem (Q1038278) (← links)
- Simultaneously scheduling multiple turns for steel color-coating production (Q1042046) (← links)
- A variable selection method based on Tabu search for logistic regression models (Q1042170) (← links)
- Heuristics for container loading of furniture (Q1044119) (← links)
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
- Tabu search techniques. A tutorial and an application to neural networks (Q1120479) (← links)
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153) (← links)
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem (Q1130046) (← links)
- Tabu search and design optimization (Q1178263) (← links)
- Location and sizing of offshore platforms for oil exploration (Q1194731) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- Experimental analysis of simulated annealing based algorithms for the layout problem (Q1197688) (← links)
- A connectionist approach to the quadratic assignment problem (Q1200824) (← links)
- Optimizing tabu list size for the traveling salesman problem (Q1265842) (← links)
- Tactical design of rail freight networks. I: Exact and heuristic methods (Q1266512) (← links)
- An SA/TS mixture algorithm for the scheduling tardiness problem (Q1266621) (← links)
- Massively parallel analog tabu search using neural networks applied to simple plant location problems (Q1268165) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Optimizing simulated annealing schedules with genetic programming (Q1268274) (← links)
- General local search methods (Q1268283) (← links)
- The life span method -- a new variant of local search (Q1275844) (← links)
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem (Q1278083) (← links)
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
- A fast tabu search algorithm for the permutation flow-shop problem (Q1278198) (← links)
- An efficient tabu search procedure for the \(p\)-median problem (Q1278496) (← links)
- Planning models for freight transportation (Q1278638) (← links)
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization (Q1280136) (← links)
- Driving tabu search with case-based reasoning (Q1280158) (← links)
- Fuzzy sets and operations research: Perspectives (Q1282905) (← links)
- A two-machine permutation flow shop scheduling problem with buffers (Q1286775) (← links)
- A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem (Q1290704) (← links)
- Heuristic concentration and tabu search: A head to head comparison (Q1291635) (← links)
- An empirical study of a new metaheuristic for the traveling salesman problem (Q1291637) (← links)
- A model for warehouse order picking (Q1291697) (← links)
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs (Q1293204) (← links)
- Local search metaheuristics for discrete-continuous scheduling problems (Q1296094) (← links)
- Location of hubs in a competitive environment (Q1296365) (← links)
