Tabu search for the BWC problem
From MaRDI portal
Publication:1928269
DOI10.1007/S10898-011-9783-1zbMath1263.05027OpenAlexW2040912445MaRDI QIDQ1928269
Ephraim Korach, Daniel Berend, Shira Zucker
Publication date: 3 January 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9783-1
Related Items (3)
Global versus local search: the impact of population sizes on evolutionary algorithm performance ⋮ Component allocation cost minimization for a multistate computer network subject to a reliability threshold using tabu search ⋮ Anticoloring of the rook's graph
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Using tabu search techniques for graph coloring
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Tabu search for large scale timetabling problems
- Anticoloring of a family of grid graphs
- Anticoloring and separation of graphs
- A probabilistic heuristic for a computationally difficult set covering problem
- Splitting trees
- Semi-greedy heuristics: An empirical study
- Future paths for integer programming and links to artificial intelligence
- Reduced constants for simple cycle graph separation
- Designing and reporting on computational experiments with heuristic methods
- Tabu search for a class of scheduling problems
- Generating labeled planar graphs uniformly at random
- The Black-and-White Coloring Problem on Trees
- A Reduction of the Anticoloring Problem to Connected Graphs
- A Separator Theorem for Planar Graphs
- Tabu Search—Part I
- Tabu Search—Part II
- Tabu Search Applied to the Quadratic Assignment Problem
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- The random planar graph process
This page was built for publication: Tabu search for the BWC problem
