Pages that link to "Item:Q1388927"

The following pages link to An exact algorithm for general, orthogonal, two-dimensional knapsack problems (Q1388927):

Displaying 42 items.

• A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
• Models and algorithms for packing rectangles into the smallest square (Q342053) (← links)
• Corner occupying theorem for the two-dimensional integral rectangle packing problem (Q362160) (← links)
• The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
• A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem (Q609809) (← links)
• The off-line group seat reservation problem (Q613435) (← links)
• Maximizing revenue with allocation of multiple advertisements on a Web banner (Q632692) (← links)
• Recent advances on two-dimensional bin packing problems (Q697576) (← links)
• Characterization and modelling of guillotine constraints (Q930945) (← links)
• Heuristic approaches for the two- and three-dimensional knapsack packing problem (Q958438) (← links)
• On the two-dimensional knapsack problem (Q1433651) (← links)
• Three-dimensional container loading models with cargo stability and load bearing constraints (Q1761946) (← links)
• An efficient deterministic heuristic for two-dimensional rectangular packing (Q1762123) (← links)
• Two-dimensional packing problems: a survey (Q1847188) (← links)
• A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis (Q1866998) (← links)
• Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem (Q1869488) (← links)
• A population heuristic for constrained two-dimensional non-guillotine cutting (Q1877899) (← links)
• Two-dimensional knapsack-block packing problem (Q1984921) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• The maximum diversity assortment selection problem (Q2040441) (← links)
• A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects (Q2189880) (← links)
• An EDA for the 2D knapsack problem with guillotine constraint (Q2418151) (← links)
• A new constraint programming approach for the orthogonal packing problem (Q2456654) (← links)
• Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem (Q2566944) (← 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 tabu search algorithm for a two-dimensional non-guillotine cutting problem (Q2643950) (← 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)
• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
• A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
• Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques (Q2675702) (← links)
• Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
• SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects (Q2803261) (← links)
• A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application (Q2803262) (← links)
• A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces (Q3401326) (← links)
• A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM (Q3503066) (← links)
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
• Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints (Q5270072) (← links)
• Analysis of upper bounds for the pallet loading problem (Q5939589) (← links)
• Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model (Q6573359) (← links)