Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
From MaRDI portal
Publication:1908990
DOI10.1007/BF01719248zbMATH Open0842.90098OpenAlexW411081660MaRDI QIDQ1908990FDOQ1908990
Publication date: 29 April 1996
Published in: OR Spektrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01719248
Recommendations
Cites Work
- Title not available (Why is that?)
- Optimization by Simulated Annealing
- Title not available (Why is that?)
- Future paths for integer programming and links to artificial intelligence
- Tabu Search—Part I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- How easy is local search?
- Title not available (Why is that?)
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Heuristic solution approaches to operational forest planning problems
- Tabu Search—Part II
- Title not available (Why is that?)
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Fast Clustering Algorithms
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- A generalized permutation approach to job shop scheduling with genetic algorithms
- A genetic search algorithm to optimize job sequencing under a technological constraint in a rolling-mill facility
- Title not available (Why is that?)
- Title not available (Why is that?)
- Evolution based learning in a job shop scheduling environment
- Algorithms for the maximum satisfiability problem
- Local search with memory: Benchmarking RTS
- Dynamic tabu list management using the reverse elimination method
- TSP ejection chains
- Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
- Title not available (Why is that?)
- Tabu search techniques. A tutorial and an application to neural networks
- Simulated Annealing – An Annotated Bibliography
- Obtaining minimum-correlation Latin hypercube sampling plans using an IP-based heuristic
- Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
- Hashing vectors for tabu search
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
- A local search approach for two-dimensional irregular cutting
- Scatter search and star-paths: Beyond the genetic metaphor
- A modification of threshold accepting and its application to the quadratic assignment problem
- Title not available (Why is that?)
- Efficient heuristics for robot acquisition planning for a CIM system
- Solving the damper placement problem via local search heuristics
- A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs
Cited In (6)
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
- Negotiation-based collaborative planning between supply chains partners
- Location and layout planning. A survey
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- Metaheuristics: A bibliography
Uses Software
This page was built for publication: Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908990)
