A Bounded Item Bin Packing Problem over Discrete Distribution

No abstract is available for this paper.

• Publication year

  2006

• Venue

  Theory and Applications of Models of Computation

• Publication date

  2006-05-15

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/11750321_10
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Average Case Analysis of Bounded Space Bin Packing Algorithms

  2007cited by this paper
• Bandwidth packing

  2001cited by this paper
• Supplier's pricing policy in a Just-in-Time environment

  2000cited by this paper
• Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings

  2000cited by this paper
• COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS

  1999cited by this paper
• Discrete Mathematics and Theoretical Computer Science (subm.), by the authors, 26–rev Analysis of Transmissions Scheduling with Packets Fragmentation

  1998cited by this paper
• Approximation algorithms for bin packing: a survey

  1996cited by this paper
• An Integer Programming Approach to the Bandwidth Packing Problem

  1996cited by this paper
• Bandwidth packing: a tabu search approach

  1993cited by this paper
• Stochastic analysis of a slotted FIFO communication channel

  1993cited by this paper
• A column generation algorithm for bandwidth packing

  1993cited by this paper
• Probabilistic analysis of packing and partitioning algorithms

  1991cited by this paper
• Internetworking with TCP/IP

  1988cited by this paper
• Martingale Inequalities and NP-Complete Problems

  1987cited by this paper
• Probabilistic analysis of some bin-packing problems

  1982cited by this paper
• OSI Reference Model - The ISO Model of Architecture for Open Systems Interconnection

  1980cited by this paper
• A Stochastic Model of Bin-Packing

  1980cited by this paper
• Introductory Combinatorics

  1977cited by this paper

• The Repacking Efficiency for Bandwidth Packing Problem

  2007cites this paper