Pages that link to "Item:Q1326509"
From MaRDI portal
The following pages link to Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509):
Displayed 4 items.
- A column generation approach for the maximal covering location problem (Q5449883) (← links)
- Integer programming approach to the printed circuit board grouping problem (Q5460557) (← links)
- Lower bounds and algorithms for the 2-dimensional vector packing problem (Q5939229) (← links)
- Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches (Q6090154) (← links)