Pages that link to "Item:Q2643948"

The following pages link to A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948):

Displaying 27 items.

• The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
• Using dual feasible functions to construct fast lower bounds for routing and location problems (Q499343) (← links)
• A survey of dual-feasible and superadditive functions (Q610986) (← links)
• The off-line group seat reservation problem (Q613435) (← links)
• Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution (Q664176) (← links)
• Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
• Multi-dimensional bin packing problems with guillotine constraints (Q976021) (← links)
• A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
• Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
• LP bounds in various constraint programming approaches for orthogonal packing (Q1761178) (← links)
• MPQ-trees for the orthogonal packing problem (Q1935724) (← links)
• Conservative scales in packing problems (Q1944876) (← links)
• Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns (Q2351163) (← links)
• A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
• An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts (Q2675700) (← links)
• An efficient deterministic optimization approach for rectangular packing problems (Q2868912) (← links)
• MPQ-trees for orthogonal packing problem (Q2883589) (← links)
• One-dimensional relaxations and LP bounds for orthogonal packing (Q3401330) (← links)
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
• (Q5152214) (← links)
• Consecutive ones matrices for multi-dimensional orthogonal packing problems (Q5891542) (← links)
• Consecutive ones matrices for multi-dimensional orthogonal packing problems (Q5917883) (← links)
• An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)