Pages that link to "Item:Q2643950"

The following pages link to A tabu search algorithm for a two-dimensional non-guillotine cutting problem (Q2643950):

Displaying 24 items.

• A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
• Maximizing revenue with allocation of multiple advertisements on a Web banner (Q632692) (← links)
• A least wasted first heuristic algorithm for the rectangular packing problem (Q960413) (← links)
• A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
• A tabu search algorithm for the bipartite drawing problem (Q1609918) (← links)
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
• An efficient deterministic heuristic for two-dimensional rectangular packing (Q1762123) (← links)
• Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows (Q1788902) (← links)
• A hybrid algorithm for the non-Guillotine cutting problem (Q1861925) (← links)
• A local search approach for two-dimensional irregular cutting (Q1908994) (← links)
• A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems (Q1988631) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• The maximum diversity assortment selection problem (Q2040441) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects (Q2189880) (← links)
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948) (← links)
• Tabu search for two-dimensional irregular cutting, (Q2776552) (← links)
• SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects (Q2803261) (← links)
• A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces (Q3401326) (← links)
• (Q5144816) (← links)
• Computational Science - ICCS 2004 (Q5712698) (← links)
• An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
• Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model (Q6573359) (← links)