Pages that link to "Item:Q2890478"

The following pages link to Laying Out Sparse Graphs with Provably Minimum Bandwidth (Q2890478):

Displaying 8 items.

• A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs (Q528766) (← links)
• Optimal linear arrangements using betweenness variables (Q1762457) (← links)
• A note on computational approaches for the antibandwidth problem (Q2051212) (← links)
• A compact quadratic model and linearizations for the minimum linear arrangement problem (Q2091791) (← links)
• A branch and bound algorithm for the matrix bandwidth minimization (Q2462146) (← links)
• A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
• (Q2861498) (← links)
• Optimization Bounds from the Branching Dual (Q5139843) (← links)