Pages that link to "Item:Q917446"
From MaRDI portal
The following pages link to Lower bounds and reduction procedures for the bin packing problem (Q917446):
Displaying 13 items.
- Exact and approximate methods for the score-constrained packing problem (Q2672111) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- Benders Decomposition for Capacitated Network Design (Q2835663) (← links)
- New Lower Bounds for Certain Classes of Bin Packing Algorithms (Q3075446) (← links)
- (Q3715136) (← links)
- Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (Q5086008) (← links)
- Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers (Q5131692) (← links)
- Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations (Q5168017) (← links)
- Lower bounds and algorithms for the 2-dimensional vector packing problem (Q5939229) (← links)
- Bounds for the cardinality constrained \(P \|C_{max}\) problem (Q5939270) (← links)
- The two-echelon stochastic multi-period capacitated location-routing problem (Q6106489) (← links)
- A two-stage stochastic location-routing problem for electric vehicles fast charging (Q6106597) (← links)
- Electric vehicles fast charger location-routing problem under ambient temperature (Q6115621) (← links)
