Pages that link to "Item:Q2942708"
From MaRDI portal
The following pages link to An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints (Q2942708):
Displayed 22 items.
- Finished-vehicle transporter routing problem solved by loading pattern discovery (Q893051) (← links)
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
- The value of integrating loading and routing (Q1752774) (← 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)
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm (Q2028818) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Models and algorithms for the delivery and installation routing problem (Q2029957) (← links)
- A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints (Q2140338) (← links)
- Multi-objective vehicle routing and loading with time window constraints: a real-life application (Q2196102) (← links)
- A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem (Q2307234) (← links)
- An open space based heuristic for the 2D strip packing problem with unloading constraints (Q2310581) (← links)
- An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery (Q2669556) (← links)
- The pallet-loading vehicle routing problem with stability constraints (Q2672112) (← links)
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- Metaheuristics for truck loading in the car production industry (Q2968504) (← links)
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← 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)
- Cargo securing under multi-drop and axle weight constraints (Q6106972) (← links)
- A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows (Q6187233) (← links)