Pages that link to "Item:Q297181"
From MaRDI portal
The following pages link to Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem (Q297181):
Displaying 10 items.
- A single machine scheduling problem with two-dimensional vector packing constraints (Q319018) (← links)
- Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
- Single workgroup scheduling problem with variable processing personnel (Q2173005) (← links)
- A branch-and-price algorithm for the two-dimensional vector packing problem (Q2329474) (← links)
- A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
- An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs (Q2670556) (← links)
- Dual Inequalities for Stabilized Column Generation Revisited (Q2806874) (← links)
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
- Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (Q6106578) (← links)
