Combinatorial optimisation algorithms for a CAD workstation

DOI10.1016/0166-218X(90)90102-IMaRDI QIDQ750305zbMATH OpenOpenAlexFDO

Authors 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

decompositionminimum spanning treecomputational experimentstask schedulingrandom search algorithmsannealinglayout of an electronic circuitparallel processing architecture

Mathematics Subject Classification ID

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

Recommendations

• Optimization by simulated annealing
• A parallel simulated annealing algorithm
• Assignment of program modules to processors: a simulated annealing approach.
• Solving VLSI physical design problems on a vector machine
• scientific article; zbMATH DE number 724213

Cites work

• scientific article; zbMATH DE number 3799403 (Why is no real title available?)
• Global optimization algorithms for a CAD workstation
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Optimization by simulated annealing
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• The Complexity of Flowshop and Jobshop Scheduling

Cited in

(1)

• Global optimization algorithms for a CAD workstation

This page was built for publication: Combinatorial optimisation algorithms for a CAD workstation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750305)