Heuristics from Nature for Hard Combinatorial Optimization Problems
From MaRDI portal
Publication:5690286
Cites work
- scientific article; zbMATH DE number 431548 (Why is no real title available?)
- scientific article; zbMATH DE number 19763 (Why is no real title available?)
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 167601 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1031416 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A classification scheme for vehicle routing and scheduling problems
- A note on finding optimum branchings
- A stochastic method for global optimization
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- An additive bounding procedure for the asymmetric travelling salesman problem
- An interactive system for constructing timetables on a PC
- Applying tabu search to the job-shop scheduling problem
- Finding approximate solutions to NP-hard problems by neural networks is hard
- Neurons with graded response have collective computational properties like those of two-state neurons
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- On the power of neural networks for solving hard problems
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- QAPLIB-A quadratic assignment problem library
- Self-organization and associative memory
- Semi-greedy heuristics: An empirical study
- Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
- Some Convergence Results for Probabilistic Tabu Search
- Some experience in applying a stochastic method to location problems
- Tabu Search—Part I
- Tabu Search—Part II
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- Tabu search techniques. A tutorial and an application to neural networks
- The convergence of symmetric threshold automata
- The vehicle routing problem: An overview of exact and approximate algorithms
- Using tabu search techniques for graph coloring
Cited in
(15)- Vehicle routing problems with alternative paths: an application to on-demand transportation
- Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
- Combinatorial optimization for an improved transition from fluence optimization to fluence delivery in IMRT treatment planning
- Rank‐based ant colony algorithms for truss weight minimization with discrete variables
- A survey for the quadratic assignment problem
- Allocation of advertising space by a web service provider using combinatorial auctions
- Application of two ant colony optimisation algorithms to water distribution system optimisation
- Dual mean field search for large scale linear and quadratic knapsack problems
- Viral systems: A new bio-inspired optimisation approach
- Thirty years of International Transactions in Operational Research: past, present, and future direction
- Systematic reviews as a metaknowledge tool: caveats and a review of available options
- Using River Formation Dynamics to Design Heuristic Algorithms
- Particle swarm optimization applied to the design of water supply systems
- A tutorial on the cross-entropy method
- Deep clustering of the traveling salesman problem to parallelize its solution
This page was built for publication: Heuristics from Nature for Hard Combinatorial Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5690286)
