An exact algorithm for general, orthogonal, two-dimensional knapsack problems
From MaRDI portal
Publication:1388927
DOI10.1016/0377-2217(93)E0278-6zbMath0903.90124OpenAlexW1991209994MaRDI QIDQ1388927
Nicos Christofides, Eleni Hadjiconstantinou
Publication date: 11 June 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0278-6
Related Items
A population heuristic for constrained two-dimensional non-guillotine cutting, A hybrid evolutionary algorithm for the two-dimensional packing problem, A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem, An improved typology of cutting and packing problems, A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, A hybrid genetic algorithm for the two-dimensional single large object placement problem, A tabu search algorithm for a two-dimensional non-guillotine cutting problem, A new exact method for the two-dimensional orthogonal packing problem, A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem, Models and algorithms for packing rectangles into the smallest square, Corner occupying theorem for the two-dimensional integral rectangle packing problem, A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem, The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview, The off-line group seat reservation problem, A cutting plane method and a parallel algorithm for packing rectangles in a circular container, Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques, An EDA for the 2D knapsack problem with guillotine constraint, A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects, A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM, Maximizing revenue with allocation of multiple advertisements on a Web banner, The three-dimensional knapsack problem with balancing constraints, Characterization and modelling of guillotine constraints, On the two-dimensional knapsack problem, A new constraint programming approach for the orthogonal packing problem, Two-dimensional knapsack-block packing problem, Heuristic approaches for the two- and three-dimensional knapsack packing problem, Three-dimensional container loading models with cargo stability and load bearing constraints, An efficient deterministic heuristic for two-dimensional rectangular packing, Recent advances on two-dimensional bin packing problems, Analysis of upper bounds for the pallet loading problem, Exact solution techniques for two-dimensional cutting and packing, Two-stage two-dimensional guillotine cutting stock problems with usable leftover, SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects, A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application, The maximum diversity assortment selection problem, A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces, Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem, Two-dimensional packing problems: a survey, Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints, A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis, Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Average-case analysis of cutting and packing in two dimensions
- Network flows and non-guillotine cutting patterns
- A comparative study of heuristics for a two-level routing-location problem
- The trim-loss and assortment problems: A survey
- Cutting stock problems and solution procedures
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An exact algorithm for the pallet loading problem
- An improved version of Wang's algorithm for two-dimensional cutting problems
- A typology of cutting and packing problems
- Efficient automated pallet loading
- The cutting stock problem in the canvas industry
- An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An approach to two-dimensional cutting stock problems
- Orthogonal Packings in Two Dimensions
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- A algorithm for two-dimensional packing
- An Algorithm for Two-Dimensional Cutting Problems
- Validation of subgradient optimization
- Multistage Cutting Stock Problems of Two and More Dimensions
- The Theory and Computation of Knapsack Functions
- The traveling-salesman problem and minimum spanning trees: Part II
- Recursive Computational Procedure for Two-dimensional Stock Cutting
