scientific article

zbMath0639.94025MaRDI QIDQ3780902

Sartaj K. Sahni, Jayaram Bhasker

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Related Items (7)

Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges ⋮ 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 ⋮ Parameterized algorithmics for linear arrangement problems ⋮ The use of dynamic programming in genetic algorithms for permutation problems ⋮ On an ordering problem in weighted hypergraphs

This page was built for publication: