A New Tabu Search Approach to the 0–1 Equicut Problem
- 1 January 1996
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A Greedy Randomized Adaptive Search Procedure for the Two-Partition ProblemOperations Research, 1994
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- The equipartition polytope. I: Formulations, dimension and basic facetsMathematical Programming, 1990
- The equipartition polytope. II: Valid inequalities and facetsMathematical Programming, 1990
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph PartitioningOperations Research, 1989
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout DesignOperations Research, 1988
- A Procedure for Placement of Standard-Cell VLSI CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- Optimization by simulated annealing: Quantitative studiesJournal of Statistical Physics, 1984
- Optimization by Simulated AnnealingScience, 1983
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970