Pages that link to "Item:Q339558"
From MaRDI portal
The following pages link to Branch and bound for the cutwidth minimization problem (Q339558):
Displaying 7 items.
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (Q337120) (← links)
- Multistart search for the cyclic cutwidth minimization problem (Q2026984) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- A note on computational approaches for the antibandwidth problem (Q2051212) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem (Q6106765) (← links)
