Pages that link to "Item:Q1847188"

The following pages link to Two-dimensional packing problems: a survey (Q1847188):

Displaying 50 items.

• A survey on the cutting and packing problems (Q2227258) (← links)
• The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
• Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
• Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem (Q2250117) (← links)
• Exact and heuristic methods for placing ships in locks (Q2256280) (← links)
• Bidirectional best-fit heuristic for orthogonal rectangular strip packing (Q2267317) (← links)
• Heuristics for packing semifluids (Q2286867) (← links)
• A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem (Q2289918) (← links)
• A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
• A hybrid chaos firefly algorithm for three-dimensional irregular packing problem (Q2338483) (← links)
• An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle (Q2338490) (← links)
• Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints (Q2356020) (← links)
• Linear models for the approximate solution of the problem of packing equal circles into a given domain (Q2356022) (← 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)
• A two-dimensional vector packing model for the efficient use of coil cassettes (Q2387252) (← links)
• Exhaustive approaches to 2D rectangular perfect packings (Q2390210) (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• The bin packing problem with item fragmentation: a worst-case analysis (Q2414454) (← links)
• An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559) (← links)
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← 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)
• New resolution algorithm and pretreatments for the two-dimensional bin-packing problem (Q2482368) (← 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)
• Sequential heuristic for the two-dimensional bin-packing problem (Q2629597) (← links)
• A variable neighborhood descent approach for the two-dimensional bin packing problem (Q2631240) (← 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)
• Arc-flow model for the two-dimensional guillotine cutting stock problem (Q2654387) (← links)
• An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem (Q2654397) (← links)
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
• Vehicle routing with private and shared delivery locations (Q2668792) (← links)
• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
• Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics (Q2672119) (← links)