scientific article; zbMATH DE number 4043771

MaRDI QIDQ3780902zbMATH OpenFDO

Authors Jayaram Bhasker, Sartaj Sahni

Publication date 1987

zbMATH Keywords

complexitybranch-and-bound, dynamic programming, Monte-Carlo methodhypergraph optimal linear arrangement problem

Mathematics Subject Classification ID

Hypergraphs (05C65) Applications of graph theory to circuits and networks (94C15)

Recommendations

• On optimal linear arrangements of trees
• Linear arrangement problems on recursively partitioned graphs
• Experiments on the minimum linear arrangement problem
• Lower bounds for the minimum linear arrangement of a graph
• Linear placement algorithms and applications to VLSI design

Cited in

(13)

• Optimum Scan-Width Selection Under Containment Constraints
• On an ordering problem in weighted hypergraphs
• Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges
• Optimal wire ordering and spacing in low power semiconductor design
• Fast simulated annealing for single-row equidistant facility layout
• A branch-and-bound algorithm for the single-row equidistant facility layout problem
• Molecular solution to the optimal linear arrangement problem based on DNA computation
• The use of dynamic programming in genetic algorithms for permutation problems
• Circuit optimization by rewiring
• Parameterized algorithmics for linear arrangement problems
• scientific article; zbMATH DE number 3914249 (Why is no real title available?)
• scientific article; zbMATH DE number 3896699 (Why is no real title available?)
• A genetic hillclimbing algorithm for the optimal linear arrangement problem

This page was built for publication:

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