8 research outputs found

    On the Generalized Poisson Distribution

    Full text link
    The Generalized Poisson Distribution (GPD) was introduced by Consul and Jain (1973). However, as remarked by Consul (1989), "It is very difficult to prove by direct summation that the sum of all the probabilities is unity". We give a shorter and more elegant proof based upon an application of Euler's classic difference lemma.Comment: 3 page

    Worst-case bounds for bin-packing heuristics with applications to the duality gap of the one-dimensional cutting stock problem

    Get PDF
    The thesis considers the one-dimensional cutting stock problem, the bin-packing problem, and their relationship. The duality gap of the former is investigated and a characterisation of a class of cutting stock problems with the next round-up property is given. It is shown that worst-case bounds for bin-packing heuristics can be and are best expressed in terms of the linear programming relaxation of the corresponding cutting stock problem. The concept of recurrency is introduced for a bin-packing heuristic, which allows a more natural derivation of a measure for the worst-case behaviour. The ideas are tested on some well known bin-packing heuristics and (slightly) tighter bounds for these are derived. These new bounds (in terms of the linear programming relaxation) are then used to make inferences about the duality gap of the cutting stock problem. In particular; these bounds allow à priori, problem-specific bounds. The thesis ends with conclusions and a number of suggestions to extend the analysis to higher dimensional problems
    corecore