Pages that link to "Item:Q502428"
From MaRDI portal
The following pages link to Solving the circular open dimension problem by using separate beams and look-ahead strategies (Q502428):
Displaying 7 items.
- A formulation space search heuristic for packing unequal circles in a fixed size circular container (Q322624) (← links)
- Packing circular-like objects in a rectangular container (Q499146) (← links)
- A hybrid beam search looking-ahead algorithm for the circular packing problem (Q711396) (← links)
- Integer programming formulations for approximate packing circles in a rectangular container (Q1718120) (← links)
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (Q2030652) (← links)
- Iterated tabu search for the circular open dimension problem (Q2253497) (← links)
- Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting (Q4634978) (← links)