Pages that link to "Item:Q323473"
From MaRDI portal
The following pages link to Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473):
Displaying 9 items.
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429) (← links)
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)
- Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups (Q6491686) (← links)
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem (Q6568392) (← links)
- A heuristic column generation approach for the stochastic bin packing problem (Q6606532) (← links)
- A heuristic-based reduction for the temporal bin packing problem with fire-ups (Q6606648) (← links)
- Trolley optimisation for loading printed circuit board components (Q6620758) (← links)
- Algorithms for the bin packing problem with scenarios (Q6646755) (← links)
- Local-search based heuristics for advertisement scheduling (Q6658437) (← links)