Combinatorial optimisation algorithms for a CAD workstation

DOI10.1016/0166-218X(90)90102-IzbMath0713.90063OpenAlexW2010013697MaRDI QIDQ750305

D. Kharzeev

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90102-i

zbMATH Keywords

decompositioncomputational experimentsminimum spanning treetask schedulingannealingrandom search algorithmslayout of an electronic circuitparallel processing architecture

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)

Cites Work

• Optimization by Simulated Annealing
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Global optimization algorithms for a CAD workstation
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• The Complexity of Flowshop and Jobshop Scheduling
• Unnamed Item