Classification of applied methods of combinatorial optimization
From MaRDI portal
Publication:844352
DOI10.1007/s10559-009-9134-0zbMath1188.90220OpenAlexW2092393087MaRDI QIDQ844352
L. F. Hulianytskyi, S. I. Sirenko, Ivan V. Sergienko
Publication date: 19 January 2010
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-009-9134-0
Related Items
Cooperative model-based metaheuristics, Solving linear unconstrained problems of combinatorial optimization on arrangements under stochastic uncertainty, Development of an algorithm for solving an asymmetric routing problem based on the ant colony method, Configuration space of geometric objects, Theory and methods of Euclidian combinatorial optimization: current status and prospects, Development and analysis of cooperative model-based metaheuristics, Properties of combinatorial optimization problems over polyhedral-spherical sets, Continuous representations and functional extensions in combinatorial optimization, Lexicographic equivalence in mixed combinatorial optimization of linear-fractional functions on arrangements
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Model-based search for combinatorial optimization: A critical survey
- Metaheuristics in combinatorial optimization
- Metaheuristic downhill simplex method in combinatorial optimization
- Variable neighbourhood search: Methods and applications
- A probabilistic heuristic for a computationally difficult set covering problem
- Variable neighborhood search
- A local search template.
- Statistical learning theory for location fingerprinting in wireless LANs
- Future paths for integer programming and links to artificial intelligence
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Viral systems: A new bio-inspired optimisation approach
- Global-best harmony search
- Quantum annealing and related optimization methods
- Rollout algorithms for combinatorial optimization
- Handbook of Approximation Algorithms and Metaheuristics
- Particle Swarm Optimization
- Computational bounds for local search in combinatorial optimization
- An approach to the construction of approximate solutions of Boolean linear programming problems
- An Efficient Heuristic Procedure for Partitioning Graphs
- The Reactive Tabu Search
- Guided Local Search
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Discrete optimization
- Parallel Metaheuristics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
