An implicit enumeration program for zero-one integer programming -- ILLIP-2 /

Thesis (M.S.)--Illinois.

A study of the effect of additional inequalities in integer programming for logical design.

Originally presented as the author's thesis (M.S.), University of Illinois at Urbana-Champaign.

Synthesis of optimal networks with NOR and NAND gates by integer programming /

"January 18, 1971."

On the synthesis by integer programming of optimal NOR gate networks for four variable switching functions /

"Supported in part by the National Science Foundation under grant no. NSF GJ-503."

An Implicit enumeration program for zero-one integer programming,

Bibliography: p. 41-42.

A code for zero-one integer linear programming by implicit enumeration, a programming manual for ILLIP.

Issued also as thesis (M.S.) University of Illinois.

Synthesis of optimal double-rail logic networks using NOR-OR gates by integer programming.

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

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."

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

Mixed-state entanglement in the light of pure-state entanglement constrained by superselection rules

We show that the classification of bi-partite pure entangled states when local quantum operations are restricted, e.g., constrained by local superselection rules, yields a structure that is analogous in many respects to that of mixed-state entanglement, including such exotic phenomena as bound entanglement and activation. This analogy aids in resolving several conceptual puzzles in the study of entanglement under restricted operations. Specifically, we demonstrate that several types of quantum optical states that possess confusing entanglement properties are analogous to bound entangled states. Also, the classification of pure-state entanglement under restricted operations can be much simpler than for mixed state entanglement. For instance, in the case of local Abelian superselection rules all questions concerning distillability can be resolved.

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.

Nonparametric tests of collectively rational consumption behavior: an integer programming procedure

We present an IP-based nonparametric (revealed preference) testing procedure for rational consumption behavior in terms of general collective models, which include consumption externalities and public consumption. An empirical application to data drawn from the Russia Longitudinal Monitoring Survey (RLMS) demonstrates the practical usefulness of the procedure. Finally, we present extensions of the testing procedure to evaluate the goodness-of-…t of the collective model subject to testing, and to quantify and improve the power of the corresponding collective rationality tests.