Pages that link to "Item:Q2935306"
From MaRDI portal
The following pages link to Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306):
Displayed 41 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)
- Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm (Q2027076) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- Two-bar charts packing problem (Q2047190) (← links)
- A hybrid metaheuristic for the two-dimensional strip packing problem (Q2069243) (← links)
- Exact optimization and decomposition approaches for shelf space allocation (Q2077910) (← links)
- Order assignment and scheduling under processing and distribution time uncertainty (Q2083940) (← links)
- A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints (Q2140338) (← links)
- Logic-based Benders decomposition algorithm for contamination detection problem in water networks (Q2289916) (← links)
- Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs (Q2333123) (← links)
- A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
- Triple-solution approach for the strip packing problem with two-staged patterns (Q2410108) (← links)
- The multi-period multi-trip container drayage problem with release and due dates (Q2664453) (← links)
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
- The pallet-loading vehicle routing problem with stability constraints (Q2672112) (← 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)
- Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) (← links)
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
- New Lower Bound and Exact Method for the Continuous Berth Allocation Problem (Q4971379) (← links)
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
- Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem (Q5086007) (← links)
- Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (Q5086008) (← links)
- Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints (Q5087714) (← links)
- The Meet-in-the-Middle Principle for Cutting and Packing Problems (Q5137950) (← links)
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem (Q6164353) (← links)