Classification of applied methods of combinatorial optimization

DOI10.1007/S10559-009-9134-0zbMATH Open1188.90220OpenAlexW2092393087MaRDI QIDQ844352FDOQ844352

Authors: L. F. Hulianytskyi, S. I. Sirenko, I. 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

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

zbMATH Keywords

metaheuristicsapproximate algorithmshyperheuristics

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Optimization by simulated annealing
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Efficient Heuristic Procedure for Partitioning Graphs
• Ant colony optimization.
• Title not available (Why is that?)
• Future paths for integer programming and links to artificial intelligence
• Title not available (Why is that?)
• Variable neighbourhood search: Methods and applications
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• Handbook of applied optimization
• Particle Swarm Optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Variable neighborhood search
• Title not available (Why is that?)
• Parallel Metaheuristics
• Hyper-Heuristics: An Emerging Direction in Modern Search Technology
• Stochastic local search. Foundations and applications.
• A probabilistic heuristic for a computationally difficult set covering problem
• Global-best harmony search
• Rollout algorithms for combinatorial optimization
• Handbook of Approximation Algorithms and Metaheuristics
• Evolutionary computation: a unified approach.
• The Reactive Tabu Search
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Simulated annealing
• Guided Local Search
• Model-based search for combinatorial optimization: A critical survey
• Metaheuristics in combinatorial optimization
• Metaheuristic downhill simplex method in combinatorial optimization
• Computational bounds for local search in combinatorial optimization
• Quantum annealing and related optimization methods
• Discrete optimization
• A local search template.
• Statistical learning theory for location fingerprinting in wireless LANs
• Viral systems: A new bio-inspired optimisation approach
• An approach to the construction of approximate solutions of Boolean linear programming problems

Cited In (10)

• Configuration space of geometric objects
• Cooperative model-based metaheuristics
• Title not available (Why is that?)
• Development of an algorithm for solving an asymmetric routing problem based on the ant colony method
• Development and analysis of cooperative model-based metaheuristics
• Theory and methods of Euclidian combinatorial optimization: current status and prospects
• Solving linear unconstrained problems of combinatorial optimization on arrangements under stochastic uncertainty
• Continuous representations and functional extensions in combinatorial optimization
• Properties of combinatorial optimization problems over polyhedral-spherical sets
• Lexicographic equivalence in mixed combinatorial optimization of linear-fractional functions on arrangements

Uses Software

• Hyperheuristics
• Tabu search

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)