Pages that link to "Item:Q1001332"
From MaRDI portal
The following pages link to Complementary column generation and bounding approaches for set partitioning formulations (Q1001332):
Displaying 8 items.
- Irregular polyomino tiling via integer programming with application in phased array antenna design (Q288219) (← links)
- An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems (Q319714) (← links)
- Modelling transfer line design problem via a set partitioning problem (Q1758032) (← links)
- A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
- Estimation of convex supports from noisy measurements (Q2040036) (← links)
- A branch-and-price algorithm for capacitated hypergraph vertex separation (Q2175443) (← links)
- Exact Solution Methods for a Generalized Assignment Problem with Location/Allocation Considerations (Q2830960) (← links)
- The persistent topology of optimal transport based metric thickenings (Q6131559) (← links)
