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 20 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)
- An asymptotic approximation scheme for the concave cost bin packing problem (Q933537) (← links)
- Modified subset sum heuristics for bin packing (Q1044695) (← 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)
- Worst case analysis of relax and fix heuristics for lot-sizing problems (Q2312339) (← links)
- A-shaped bin packing: Worst case analysis via simulation (Q2386612) (← 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)
- Average-case analysis of the bin-packing problem with general cost structures (Q4363421) (← links)
- AN APPROACH FOR WORST CASE ANALYSIS OF HEURISTICS : ANALYSIS OF A FLEXIBLE 0-1 KNAPSACK PROBLEM (Q4834043) (← links)
- Bin‐packing problem with concave costs of bin utilization (Q5438528) (← 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)
