An approximation algorithm for solving unconstrained two-dimensional knapsack problems
From MaRDI portal
Publication:1127219
DOI10.1016/0377-2217(93)E0221-IzbMATH Open0928.90076OpenAlexW2063603369MaRDI QIDQ1127219FDOQ1127219
Authors: Didier Fayard, V. Zissimopoulos 
Publication date: 13 August 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)e0221-i
Recommendations
- An approximation scheme for the two-stage, two-dimensional knapsack problem
- Faster approximation schemes for the two-dimensional knapsack problem
- Faster Approximation Schemes for the Two-Dimensional Knapsack Problem
- Approximation algorithms for a two-phase knapsack problem
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- On the approximability of the two-phase knapsack problem
- A note on a two dimensional knapsack problem with unloading constraints
- Some thoughts on the 2-approximation algorithm for knapsack problems: a survey
- On the two-dimensional knapsack problem
- A new approximation algorithm for the knapsack problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Fast Approximation Algorithms for Knapsack Problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- An Algorithm for Large Zero-One Knapsack Problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Cutting stock problems and solution procedures
- An Algorithm for Two-Dimensional Cutting Problems
- The trim-loss and assortment problems: A survey
- The Theory and Computation of Knapsack Functions
- Heuristic algorithms for the multiple knapsack problem
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Dynamic programming algorithms for the zero-one knapsack problem
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Title not available (Why is that?)
- An algorithm for the solution of the 0-1 knapsack problem
- A Solution of the Rectangular Cutting-Stock Problem
- Cutting Stock, Linear Programming, Knapsacking, Dynamic Programming and Integer Programming, Some Interconnections
- Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
- Multiprogram scheduling
- Resolution of the 0–1 knapsack problem: Comparison of methods
- The cutting stock problem for large sections in the iron and steel industries
Cited In (30)
- Two-dimensional knapsack-block packing problem
- Faster Approximation Schemes for the Two-Dimensional Knapsack Problem
- Title not available (Why is that?)
- Solving packing problems by a distributed global optimization algorithm
- Simple block patterns for the two-dimensional cutting problem
- A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH
- An approximation scheme for the two-stage, two-dimensional knapsack problem
- Generating optimal two-section cutting patterns for rectangular blanks
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Heuristic for constrained T-shape cutting patterns of rectangular pieces
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- An exact rectangular two-segment layout algorithm with optimal same-shape strip generation
- Tight complexity bounds for the two-dimensional real knapsack problem
- Fast heuristic for constrained homogenous T-shape cutting patterns
- Approximation algorithms for a two-phase knapsack problem
- On the two-dimensional knapsack problem
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
- Two dimensional knapsack with unloading constraints
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
- Maximizing revenue with allocation of multiple advertisements on a Web banner
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
- Applying genetic algorithms and neural networks to the container loading problem
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- Two-stage general block patterns for the two-dimensional cutting problem
- A recursive exact algorithm for weighted two-dimensional cutting
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- Recursive algorithm for the two‐dimensional cutting problem of punched strips
This page was built for publication: An approximation algorithm for solving unconstrained two-dimensional knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127219)
