Pages that link to "Item:Q4814179"

The following pages link to New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem (Q4814179):

Displaying 27 items.

• A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
• A Lagrangian heuristic for sprint planning in agile software development (Q336900) (← links)
• The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
• Logistic constraints in container loading problems: the impact of complete shipment conditions (Q828763) (← links)
• Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
• A branch and bound algorithm for the strip packing problem (Q1017971) (← links)
• On the two-dimensional knapsack problem (Q1433651) (← links)
• Exact algorithms for the two-dimensional guillotine knapsack (Q1761943) (← 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)
• The maximum diversity assortment selection problem (Q2040441) (← links)
• Enhanced formulation for the Guillotine 2D Cutting knapsack problem (Q2099494) (← links)
• A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects (Q2189880) (← links)
• The exact solutions of several types of container loading problems (Q2301942) (← 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)
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
• A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
• Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming (Q2960367) (← links)
• Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
• A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM (Q3503066) (← links)
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
• The Meet-in-the-Middle Principle for Cutting and Packing Problems (Q5137950) (← 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)
• A combinatorial flow-based formulation for temporal bin packing problems (Q6109803) (← links)