Classification of applied methods of combinatorial optimization
From MaRDI portal
Recommendations
- Metaheuristics in combinatorial optimization
- Hybrid metaheuristics. An emerging approach to optimization.
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Metaheuristics: A bibliography
- Formalization and classification of combinatorial optimization problems
Cites work
- scientific article; zbMATH DE number 3817388 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 3589743 (Why is no real title available?)
- scientific article; zbMATH DE number 1974042 (Why is no real title available?)
- scientific article; zbMATH DE number 2010446 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- scientific article; zbMATH DE number 2159378 (Why is no real title available?)
- scientific article; zbMATH DE number 2159379 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3801290 (Why is no real title available?)
- scientific article; zbMATH DE number 2117227 (Why is no real title available?)
- A local search template.
- A probabilistic heuristic for a computationally difficult set covering problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- An approach to the construction of approximate solutions of Boolean linear programming problems
- Ant colony optimization.
- Computational bounds for local search in combinatorial optimization
- Discrete optimization
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Evolutionary computation: a unified approach.
- Future paths for integer programming and links to artificial intelligence
- Global-best harmony search
- Guided Local Search
- Handbook of Approximation Algorithms and Metaheuristics
- Handbook of applied optimization
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Metaheuristic downhill simplex method in combinatorial optimization
- Metaheuristics in combinatorial optimization
- Model-based search for combinatorial optimization: A critical survey
- Optimization by simulated annealing
- Parallel Metaheuristics
- Particle Swarm Optimization
- Quantum annealing and related optimization methods
- Rollout algorithms for combinatorial optimization
- Simulated annealing
- Statistical learning theory for location fingerprinting in wireless LANs
- Stochastic local search. Foundations and applications.
- The Reactive Tabu Search
- Variable neighborhood search
- Variable neighbourhood search: Methods and applications
- Viral systems: A new bio-inspired optimisation approach
Cited in
(10)- Development and analysis of cooperative model-based metaheuristics
- Development of an algorithm for solving an asymmetric routing problem based on the ant colony method
- Lexicographic equivalence in mixed combinatorial optimization of linear-fractional functions on arrangements
- Theory and methods of Euclidian combinatorial optimization: current status and prospects
- Configuration space of geometric objects
- Solving linear unconstrained problems of combinatorial optimization on arrangements under stochastic uncertainty
- Continuous representations and functional extensions in combinatorial optimization
- Cooperative model-based metaheuristics
- scientific article; zbMATH DE number 49308 (Why is no real title available?)
- Properties of combinatorial optimization problems over polyhedral-spherical sets
This page was built for publication: Classification of applied methods of combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844352)
