Pages that link to "Item:Q1928510"

The following pages link to A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510):

Displaying 10 items.

• Branch and bound for the cutwidth minimization problem (Q339558) (← links)
• On a binary distance model for the minimum linear arrangement problem (Q458974) (← links)
• A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants (Q716345) (← links)
• A branch-and-cut algorithm for the equicut problem (Q1373750) (← links)
• On minimum cuts and the linear arrangement problem (Q1570828) (← links)
• Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
• A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
• A variation on the min cut linear arrangement problem (Q3785979) (← links)
• (Q3801338) (← links)
• A branch and bound algorithm for the minimum storage-time sequencing problem (Q4434517) (← links)