An approximation scheme for the two-stage, two-dimensional knapsack problem
From MaRDI portal
Publication:429647
DOI10.1016/J.DISOPT.2010.03.003zbMATH Open1241.90102OpenAlexW2153325184MaRDI QIDQ429647FDOQ429647
Authors: Alberto Caprara, Andrea Lodi, Michele Monaci 
Publication date: 20 June 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2010.03.003
Recommendations
- scientific article; zbMATH DE number 2086931
- Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
- On the two-dimensional knapsack problem
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Faster Approximation Schemes for the Two-Dimensional Knapsack Problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Bin packing can be solved within 1+epsilon in linear time
- The multiple subset sum problem
- Integer Programming with a Fixed Number of Variables
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Title not available (Why is that?)
- Maximizing the total profit of rectangles packed into a rectangle
- A structural lemma in 2-dimensional packing, and its implications on approximability
- On the two-dimensional knapsack problem
- Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
Cited In (16)
- Faster approximation schemes for the two-dimensional knapsack problem
- On the approximability of the two-phase knapsack problem
- Faster Approximation Schemes for the Two-Dimensional Knapsack Problem
- Title not available (Why is that?)
- A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH
- Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
- Title not available (Why is that?)
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Tight complexity bounds for the two-dimensional real knapsack problem
- 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
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Two-dimensional knapsack for circles
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
This page was built for publication: An approximation scheme for the two-stage, two-dimensional knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429647)
