Pages that link to "Item:Q4301293"
From MaRDI portal
The following pages link to Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures (Q4301293):
Displaying 13 items.
- Exact and approximate methods for a one-dimensional minimax bin-packing problem (Q363606) (← links)
- Scheduling with tool changes to minimize total completion time: Basic results and SPT performance (Q703937) (← links)
- Worst-case analysis of fast heuristics for packing squares into a square (Q1365944) (← links)
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
- Lower bounds for a bin packing problem with linear usage cost (Q1755229) (← links)
- Batch scheduling of nonidentical job sizes with minsum criteria (Q2051908) (← links)
- An enhanced grasshopper optimization algorithm to the Bin packing problem (Q2199919) (← links)
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization (Q2427181) (← links)
- Bin packing with general cost structures (Q2429476) (← links)
- Parameterized complexity of configuration integer programs (Q2670456) (← links)
- An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs (Q2670556) (← links)
- Augmented neural networks and problem structure-based heuristics for the bin-packing problem (Q5497425) (← links)
- Lower and upper bounding procedures for the bin packing problem with concave loading cost (Q6069214) (← links)
