Pages that link to "Item:Q1847188"
From MaRDI portal
The following pages link to Two-dimensional packing problems: a survey (Q1847188):
Displayed 38 items.
- The layout problem of two kinds of graph elements with performance constraints and its optimality conditions (Q815991) (← links)
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation (Q863991) (← links)
- The constrained compartmentalised knapsack problem (Q868151) (← links)
- Two- and three-dimensional parametric packing (Q875405) (← links)
- On the complexity of adjacent resource scheduling (Q880528) (← links)
- Characterization and modelling of guillotine constraints (Q930945) (← links)
- A coupling cutting stock-lot sizing problem in the paper industry (Q940851) (← links)
- Reactive GRASP for the strip-packing problem (Q941532) (← links)
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem (Q941553) (← links)
- A least wasted first heuristic algorithm for the rectangular packing problem (Q960413) (← links)
- New lower bounds for the three-dimensional finite bin packing problem (Q1827849) (← links)
- Heuristic algorithms for the three-dimensional bin packing problem (Q1847192) (← links)
- Integrated shipment dispatching and packing problems: a case study (Q2369964) (← links)
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem (Q2378415) (← links)
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle (Q2387245) (← links)
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559) (← links)
- An enumeration scheme to generate constrained exact checkerboard patterns (Q2462561) (← links)
- An optimization algorithm for a penalized knapsack problem (Q2466588) (← links)
- Two-dimensional bin packing with one-dimensional resource augmentation (Q2467124) (← links)
- Improved local search algorithms for the rectangle packing problem with general spatial costs (Q2484340) (← links)
- A 3-approximation algorithm for two-dimensional bin packing (Q2488211) (← links)
- A new heuristic recursive algorithm for the strip rectangular packing problem (Q2489283) (← links)
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization (Q2496055) (← links)
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem (Q2566944) (← links)
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems (Q2569035) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948) (← links)
- A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
- A new exact method for the two-dimensional orthogonal packing problem (Q2643952) (← links)
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem (Q2643953) (← links)
- Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic (Q2643955) (← links)
- A dynamic adaptive local search algorithm for the circular packing problem (Q2643959) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- A two-dimensional strip cutting problem with sequencing constraint (Q2643967) (← links)
- Optimising the cutting of wood fibre plates in the hardboard industry (Q2643972) (← links)
- A note on linear models for two-group and three-group two-dimensional guillotine cutting problems (Q3605433) (← links)
- TOC-based planning and scheduling model (Q4671272) (← links)
- Linear models for 1-group two-dimensional guillotine cutting problems (Q5485054) (← links)