Pages that link to "Item:Q2189955"
From MaRDI portal
The following pages link to Solving a large cutting problem in the glass manufacturing industry (Q2189955):
Displaying 9 items.
- A cutting and scheduling problem in float glass manufacturing (Q398905) (← links)
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (Q2030652) (← links)
- A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem (Q2077966) (← links)
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem (Q2099494) (← links)
- An efficient heuristic for minimizing the number of moves for the retrieval of a single item in a puzzle-based storage system with multiple escorts (Q2140139) (← links)
- An optimization model for trim loss minimization in an automotive glass plant (Q2643973) (← links)
- A beam search algorithm for minimizing crane times in premarshalling problems (Q2672129) (← links)
- Evolutionary Computation in Combinatorial Optimization (Q5901735) (← links)
- Exact approaches for the unconstrained two-dimensional cutting problem with defects (Q6068735) (← links)