Spelling suggestions: "subject:"combinatorial enumeration problems"" "subject:"ombinatorial enumeration problems""
1 
A reformulationlinearization based implicit enumeration algorithm for the rectilinear distance locationallocation problem /Ramachandran, Sridhar, January 1991 (has links)
Thesis (M.S.)Virginia Polytechnic Institute and State University, 1991. / Vita. Abstract. Includes bibliographical references (leaves 7577). Also available via the Internet.

2 
Asymptotic enumeration for combinatorial structures /Maxwell, Mark M. January 1994 (has links)
Thesis (Ph. D.)Oregon State University, 1995. / Typescript (photocopy). Includes bibliographical references (leaves 5254). Also available on the World Wide Web.

3 
Enumeration of the generalized Catalan numbersRichardson, Steven L. January 2005 (has links)
Thesis (M.S.)West Virginia University, 2005. / Title from document title page. Document formatted into pages; contains iii, 33 p. Includes abstract. Includes bibliographical references (p. 33).

4 
Sampling edge covers /Rummler, William August. January 2009 (has links)
Thesis (M.S.)Rochester Institute of Technology, 2009. / Typescript. Includes bibliographical references (leaves 4243).

5 
Some studies on the monomerdimer problemMenon, V. V. January 1968 (has links)
No description available.

6 
Matrix correspondences and the enumeration of plane partitions.Gansner, Emden Robert January 1978 (has links)
Thesis. 1978. Ph.D.Massachusetts Institute of Technology. Dept. of Mathematics. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE. / Vita. / Bibliography: p. 213217. / Ph.D.

7 
Combinatorial algorithms on partially ordered setsKoda, Yasunori 29 June 2018 (has links)
The main results of this dissertation are various algorithms related to partially ordered sets. The dissertation basically consists of two parts. The first part treats algorithms that generate ideals of partially ordered sets. The second part concerns the generation of partially ordered sets themselves.
First, we present two algorithms for listing ideals of a forest poset. These algorithms generate ideals in a Gray Code manner, that is, consecutive ideals differ by exactly one element. Both algorithms use storage O(n), where n is the number of elements in the poset. The first algorithm traverses, at each phase, the current ideal being listed and runs in time O(nN), where N is the number of ideals of the poset. The second algorithm mimics the first but eliminates the traversal and runs in time O(N). This algorithm has the property that the amount of computation between successive ideals is O(1).
Secondly, we give orderly algorithms for constructing acyclic digraphs, acyclic transitive digraphs, finite topologies and finite topologies and finite lattices. For the first time we show that the number of finite lattices on 11, 12, and 13 elements are 37622, 262775, and 2018442, respectively, and the number of finite topologies on 8 and 9 elements are 35979 and 363083, respectively.
We also describe orderly algorithms for generating kcolored graphs. We present, in particular, an algorithm for generating connected bicolorable graphs. We also prove some properties of a canonic matrix which might be generally useful for improving the efficiency of orderly algorithms. / Graduate

8 
A reformulationlinearization based implicit enumeration algorithm for the rectilinear distance locationallocation problemRamachandran, Sridhar 10 October 2009 (has links)
This thesis is concerned with the analysis of a Rectilinear Distance Location Allocation Problem, where the costs are directly proportional to rectilinear distances and the amount shipped. The problem is formulated as a Mixed Integer Bilinear Programming Problem and as a Discrete Location Allocation Problem. Using linear programming relaxations constructed via the ReformulationLinearization Technique (RLT), the latter formulation is shown to provide stronger lower bounds and is therefore adopted for implementation. In addition, cutting planes are developed to further strengthen the linear programming relaxation. The special structure of the resulting linear program is exploited in order to get a quick lower bound via a suitable Lagrangian dual formulation. This lower bounding scheme is embedded within a finitely convergent Branch and Bound algorithm that enumerates over the location decision variable space. An illustrative example and computational experience are provided to demonstrate the efficacy of the proposed algorithm. / Master of Science

9 
Multivariate finite operator calculus applied to counting ballot paths containing patterns [electronic resource]Unknown Date (has links)
Counting lattice paths where the number of occurrences of a given pattern is monitored requires a careful analysis of the pattern. Not the length, but the characteristics of the pattern are responsible for the difficulties in finding explicit solutions. Certain features, like overlap and difference in number of ! and " steps determine the recursion formula. In the case of ballot paths, that is paths the stay weakly above the line y = x, the solutions to the recursions are typically polynomial sequences. The objects of Finite Operator Calculus are polynomial sequences, thus the theory can be used to solve the recursions. The theory of Finite Operator Calculus is strengthened and extended to the multivariate setting in order to obtain solutions, and to prepare for future applications. / by Shaun Sullivan. / Thesis (Ph.D.)Florida Atlantic University, 2011. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2011. Mode of access: World Wide Web.

10 
Algebraic and combinatorial aspects of group factorizationsUnknown Date (has links)
The aim of this work is to investigate some algebraic and combinatorial aspects of group factorizations. The main contribution of this dissertation is a set of new results regarding factorization of groups, with emphasis on the nonabelian case. We introduce a novel technique for factorization of groups, the socalled free mappings, a powerful tool for factorization of a wide class of abelian and nonabelian groups. By applying a certain group action on the blocks of a factorization, a number of combinatorial and computational problems were noted and studied. In particular, we analyze the case of the group Aut(Zn) acting on blocks of factorization of Zn. We present new theoretical facts that reveal the numerical structure of the stabilizer of a set in Zn, under the action of Aut(Zn). New algorithms for finding the stabilizer of a set and checking whether two sets belong to the same orbit are proposed. / by Vladimir Bozovic. / Thesis (Ph.D.)Florida Atlantic University, 2008. / Includes bibliography. / Electronic reproduction. Boca Raton, FL : 2008 Mode of access: World Wide Web.

Page generated in 0.1227 seconds