Pages that link to "Item:Q1827849"
From MaRDI portal
The following pages link to New lower bounds for the three-dimensional finite bin packing problem (Q1827849):
Displaying 13 items.
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP (Q337416) (← links)
- Using dual feasible functions to construct fast lower bounds for routing and location problems (Q499343) (← links)
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing (Q610979) (← links)
- A survey of dual-feasible and superadditive functions (Q610986) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation (Q868985) (← links)
- Constraints in container loading -- a state-of-the-art review (Q2355797) (← links)
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem (Q2378415) (← links)
- A comparative review of 3D container loading algorithms (Q2803269) (← links)
- (Q2861521) (← links)
- Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem (Q4979988) (← links)
- The multiple container loading problem with loading docks (Q6146635) (← links)
- A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints (Q6195023) (← links)
