On the approximability of the two-phase knapsack problem
From MaRDI portal
Publication:2279756
Recommendations
Cites work
- A combination of flow shop scheduling and the shortest path problem
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- A study on several combination problems of classic shop scheduling and shortest path
- An approximation algorithm for the generalized assignment problem
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
- Approximation schemes for knapsack problems with shelf divisions
- Bin packing can be solved within 1+epsilon in linear time
- Bounds for nested knapsack problems
- Combination of parallel machine scheduling and vertex cover
- Combination of two-machine flow shop scheduling and shortest path problems
- Combinations of some shop scheduling problems and the shortest path problem: complexity and approximation algorithms
- Exact methods for the knapsack problem and its generalizations
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- On two-stage stochastic knapsack problems
- Packing groups of items into multiple knapsacks
- Parameterized approximation scheme for the multiple knapsack problem
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Technical Note—The Multiperiod Knapsack Problem
- The design of approximation algorithms
- Tight approximation algorithms for maximum separable assignment problems
Cited in
(11)- On the multiperiod binary knapsack problem
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Tight complexity bounds for the two-dimensional real knapsack problem
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Approximation algorithms for a two-phase knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- On approximating the incremental knapsack problem
- scientific article; zbMATH DE number 3900493 (Why is no real title available?)
- Faster Approximation Schemes for the Two-Dimensional Knapsack Problem
- Approximation Algorithms for a Bi-level Knapsack Problem
- A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH
This page was built for publication: On the approximability of the two-phase knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279756)
