The following pages link to (Q3048582):
Displaying 6 items.
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach (Q320623) (← links)
- The petrol station replenishment problem with time windows (Q955625) (← links)
- Packing problems (Q1197916) (← links)
- Scheduling with neural networks -- the case of the Hubble Space Telescope (Q1200817) (← links)
- Lower bounds and algorithms for the minimum cardinality bin covering problem (Q1752204) (← links)
- Heuristics and lower bounds for the bin packing problem with conflicts (Q1765544) (← links)