Pages that link to "Item:Q2337386"

The following pages link to A branch-and-price algorithm for the temporal bin packing problem (Q2337386):

Displaying 18 items.

• Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups (Q2080827) (← links)
• Interval scheduling with economies of scale (Q2108158) (← links)
• An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
• Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning (Q2668752) (← links)
• Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) (← links)
• Branch and Price for Chance-Constrained Bin Packing (Q3386782) (← links)
• A branch and bound algorithm for the minimum storage-time sequencing problem (Q4434517) (← links)
• Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation (Q5964827) (← links)
• On data reduction for dynamic vector bin packing (Q6047700) (← links)
• Airfreight forwarder's shipment planning: shipment consolidation and containerization (Q6065643) (← links)
• Lower and upper bounding procedures for the bin packing problem with concave loading cost (Q6069214) (← links)
• Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (Q6106578) (← links)
• Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems (Q6109390) (← links)
• A combinatorial flow-based formulation for temporal bin packing problems (Q6109803) (← links)
• Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups (Q6491686) (← links)
• A heuristic-based reduction for the temporal bin packing problem with fire-ups (Q6606648) (← links)
• Algorithms for the bin packing problem with scenarios (Q6646755) (← links)