A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

No abstract is available for this paper.

• Publication year

  1999

• Venue

  RANDOM-APPROX

• Publication date

  1999-08-08

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-540-48413-4_6
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A New Fully Polynomial Approximation Scheme for the Knapsack Problem

  1998cited by this paper
• The Multiple Subset Sum Problem

  1998cited by this paper
• Knapsack Problems: Algorithms and Computer Implementations

  1990cited by this paper
• Integer Programming with a Fixed Number of Variables

  1983cited by this paper

• Scheduling on Multiple Two-Stage Flowshops with a Deadline

  2021cites this paper
• A -approximation algorithm for scheduling on two parallel machines with job delivery coordination

  2019cites this paper
• Packing Groups of Items into Multiple Knapsacks

  2018cites this paper
• An Improved Generalized Quantum-Inspired Evolutionary Algorithm for Multiple Knapsack Problem

  2018cites this paper
• An Improved Dynamic Programming for Power Allocation in Cognitive Radio

  2015cites this paper
• Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem

  2015cites this paper
• Bin packing approximation algorithms: Survey and classification

  2013cites this paper
• Prompt Mechanism for Ad Placement over Time

  2011cites this paper
• A Generic Set-Based Particle Swarm Optimization Algorithm

  2011cites this paper
• Coordinated scheduling of production and delivery with production window and delivery capacity constraints

  2010cites this paper
• Solving the Maximum Cardinality Bin Packing Problem with a Weight Annealing-Based Algorithm

  2009cites this paper
• Parameterized Approximation Scheme for the Multiple Knapsack Problem

  2009cites this paper
• A fast asymptotic approximation scheme for bin packing with rejection

  2007influential citation
• Approximation and online algorithms in scheduling and coloring

  2006cites this paper
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

  2005cites this paper
• Upper bounds and algorithms for the maximum cardinality bin packing problem

  2003cites this paper
• On maximizing the throughput of multiprocessor tasks

  2002cites this paper
• Optimizing a mail-order with discount and shipping costs

  2002cites this paper
• A PTAS for the Multiple Subset Sum Problem with different knapsack capacities

  2000cites this paper
• Scheduling Jobs before Shut-Down

  2000cites this paper