Computational experience in all-integer, binary variable, integer programming problems using Gomory's all-integer algorithm,

Bibliographical footnotes.

Implicit enumeration algorithm of integer programming on Illiac IV,

Bibliography: p. 29.

Optimum network design using NOR-OR gates by integer programming.

"Supported in part by ... Grant no. NSF GJ-503."

Cursus integer theologicus iuxta miram mentem V. Doctoris ... Joannis Duns Scoti dispositus ... : tomus primus ... /

Mode of access: Internet.

RR. PP. Bartholomaei Mastrii ... et Bonaventurae Belluti ... Philosophiae ad mentem Scoti cursus integer : tomus primus : continens Disputationes in Aristotelis Logicam.

Mode of access: Internet.

Barlow's tables of squares, cubes, square roots, cube roots, reciprocals of all integer numbers up to 10,000.

Mode of access: Internet.

Disaggregation of Microcystis aeruginosa colonies under turbulent mixing: laboratory experiments in a grid-stirred tank

Samples of the cyanobacterium Microcystis aeruginosa from a small pond were used in laboratory experiments with a grid-stirred tank to quantify the effect of turbulent mixing on colony size. Turbulent dissipation in the tank was varied from 10(-9) m(2) s(-3) to 10(-4) m(2) s(-3), covering the range of turbulence intensities experienced by M. aeruginosa colonies in the field and exceeding the maximum dissipation by two orders of magnitude. Large colonies broke up into smaller colonies during the experiments; the mass fraction of colonies with diameter less than 200 mum increased over time. Colony disaggregation was observed to increase with turbulent dissipation. The maximum stable colony diameter across all experiments was in the range 220-420 mum. The overall change in size distribution during the experiments was relatively small, and the colony size distribution remained very broad throughout the experiments. Since colony size affects migration velocity, susceptibility to grazing and surface area to volume ratios, more work is needed to determine how to best represent this broad size distribution when modelling M. aeruginosa populations.

Heuristic algorithm for computing reversal distance with multigene families via binary integer programming

Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum number of reversals required for rearranging a genome to another when gene duplication is nonexisting. In this paper, we show how to extend the Hannenhalli-Pevzner approach to genomes with multigene families. We propose a new heuristic algorithm to compute the reversal distance between two genomes with multigene families via the concept of binary integer programming without removing gene duplicates. The experimental results on simulated and real biological data demonstrate that the proposed algorithm is able to find the reversal distance accurately. ©2005 IEEE

An integer-valued data envelopment analysis model with bounded outputs

Integer-valued data envelopment analysis (DEA) with alternative returns to scale technology has been introduced and developed recently by Kuosmanen and Kazemi Matin. The proportionality assumption of their introduced "natural augmentability" axiom in constant and nondecreasing returns to scale technologies makes it possible to achieve feasible decision-making units (DMUs) of arbitrary large size. In many real world applications it is not possible to achieve such production plans since some of the input and output variables are bounded above. In this paper, we extend the axiomatic foundation of integer-valuedDEAmodels for including bounded output variables. Some model variants are achieved by introducing a new axiom of "boundedness" over the selected output variables. A mixed integer linear programming (MILP) formulation is also introduced for computing efficiency scores in the associated production set. © 2011 The Authors. International Transactions in Operational Research © 2011 International Federation of Operational Research Societies.

A fuzzy AHP based integer linear programming model for the multi-criteria transshipment problem

Purpose – The purpose of this research is to develop a holistic approach to maximize the customer service level while minimizing the logistics cost by using an integrated multiple criteria decision making (MCDM) method for the contemporary transshipment problem. Unlike the prevalent optimization techniques, this paper proposes an integrated approach which considers both quantitative and qualitative factors in order to maximize the benefits of service deliverers and customers under uncertain environments. Design/methodology/approach – This paper proposes a fuzzy-based integer linear programming model, based on the existing literature and validated with an example case. The model integrates the developed fuzzy modification of the analytic hierarchy process (FAHP), and solves the multi-criteria transshipment problem. Findings – This paper provides several novel insights about how to transform a company from a cost-based model to a service-dominated model by using an integrated MCDM method. It suggests that the contemporary customer-driven supply chain remains and increases its competitiveness from two aspects: optimizing the cost and providing the best service simultaneously. Research limitations/implications – This research used one illustrative industry case to exemplify the developed method. Considering the generalization of the research findings and the complexity of the transshipment service network, more cases across multiple industries are necessary to further enhance the validity of the research output. Practical implications – The paper includes implications for the evaluation and selection of transshipment service suppliers, the construction of optimal transshipment network as well as managing the network. Originality/value – The major advantages of this generic approach are that both quantitative and qualitative factors under fuzzy environment are considered simultaneously and also the viewpoints of service deliverers and customers are focused. Therefore, it is believed that it is useful and applicable for the transshipment service network design.

Integer Points Close to a Smooth Curve

∗ This research is partially supported by the Bulgarian National Science Fund under contract MM-403/9

Branching Processes with Immigration and Integer-valued Time Series

In this paper, we indicate how integer-valued autoregressive time series Ginar(d) of ordre d, d ≥ 1, are simple functionals of multitype branching processes with immigration. This allows the derivation of a simple criteria for the existence of a stationary distribution of the time series, thus proving and extending some results by Al-Osh and Alzaid [1], Du and Li [9] and Gauthier and Latour [11]. One can then transfer results on estimation in subcritical multitype branching processes to stationary Ginar(d) and get consistency and asymptotic normality for the corresponding estimators. The technique covers autoregressive moving average time series as well.