Discrete/Binary Approach
From MaRDI portal
Publication:3649626
DOI10.1007/978-3-540-92151-6_6zbMath1176.90519OpenAlexW117342958MaRDI QIDQ3649626
P. N. Suganthan, M. Fatih Tasgetiren, Yun-Chia Liang, Quan-ke Pan
Publication date: 4 December 2009
Published in: Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-92151-6_6
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A random-key genetic algorithm for the generalized traveling salesman problem
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
- The dynamic programming method in the generalized traveling salesman problem
- New optimization techniques in engineering.
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
- The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Some Applications of the Generalized Travelling Salesman Problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Process planning for rotational parts using the generalized travelling salesman problem
- The symmetric generalized traveling salesman polytope
- A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Discrete/Binary Approach
