Pages that link to "Item:Q2935306"
From MaRDI portal
The following pages link to Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306):
Displayed 15 items.
- The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem (Q724050) (← links)
- A new search procedure for the two-dimensional orthogonal packing problem (Q894552) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem (Q1634095) (← links)
- Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation (Q1652199) (← links)
- Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows (Q1694312) (← links)
- Combinatorial Benders cuts for assembly line balancing problems with setups (Q1751843) (← links)
- The Benders decomposition algorithm: a literature review (Q1751891) (← links)
- The value of integrating loading and routing (Q1752774) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem (Q1999621) (← links)
- Triple-solution approach for the strip packing problem with two-staged patterns (Q2410108) (← links)
- On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs (Q2835657) (← links)
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)