Pages that link to "Item:Q1708742"

The following pages link to Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods (Q1708742):

Displaying 35 items.

• Cutting and packing optimization. Problems modeling and solution methods. (Q931915) (← links)
• The skiving stock problem and its relation to hypergraph matchings (Q1662646) (← links)
• Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case (Q1730578) (← links)
• A typology of cutting and packing problems (Q1825761) (← links)
• Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← 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)
• On tackling reverse convex constraints for non-overlapping of unequal circles (Q2045013) (← links)
• Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups (Q2080827) (← links)
• Intelligent algorithms for packing and cutting problem (Q2082093) (← links)
• An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
• Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes (Q2160486) (← links)
• Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost (Q2168751) (← links)
• Solving a large cutting problem in the glass manufacturing industry (Q2189955) (← links)
• Irregular packing problems: a review of mathematical models (Q2286866) (← links)
• A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem (Q2289918) (← links)
• Improved flow-based formulations for the skiving stock problem (Q2333124) (← links)
• An improved typology of cutting and packing problems (Q2643945) (← links)
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
• Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) (← links)
• Packing convex polygons in minimum-perimeter convex hulls (Q2679237) (← links)
• Model development and solver demonstrations using randomized test problems (Q2689552) (← links)
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography (Q4018161) (← links)
• Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory (Q4646531) (← links)
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
• Decomposition Algorithm for Irregular Placement Problems (Q5117305) (← links)
• Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem (Q5117310) (← links)
• An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
• Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern (Q6067889) (← links)
• A combinatorial flow-based formulation for temporal bin packing problems (Q6109803) (← links)
• A branch-and-bound approach for a vehicle routing problem with customer costs (Q6114901) (← links)
• Optimization and Optimal Control Approach to Japanese Sangaku Six Equal Circles Problem (Q6490264) (← links)
• Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups (Q6491686) (← links)
• A heuristic-based reduction for the temporal bin packing problem with fire-ups (Q6606648) (← links)
• Models for two-dimensional bin packing problems with customer order spread (Q6621849) (← links)