A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs
DOI10.1016/S0377-2217(97)00381-0zbMATH Open0948.90143OpenAlexW1971435380MaRDI QIDQ1806891FDOQ1806891
Publication date: 20 December 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00381-0
Recommendations
simulated annealingdirected acyclic graphgraph partitioningtabu searchneighbourhood structurecompound moveminimum cost partition
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Tabu Search—Part I
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Tabu Search—Part II
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Title not available (Why is that?)
- Optimal Sequential Partitions of Graphs
- A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
Cited In (2)
This page was built for publication: A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806891)
