Search for dissertations about: "Integer Sequences"
Showing result 1 - 5 of 11 swedish dissertations containing the words Integer Sequences.
-
1. On Degree Variance in Random Graphs
Abstract : This thesis is concerned with degree moments and degree variance in random graphs. The degree of vertex i in a graph is the number of edges incident to vertex i.In the first paper, degree moments and functions of degree moments are investigated for three random graph models. READ MORE
-
2. Sequences and games generalizing the combinatorial game of Wythoff Nim
Abstract : One single Queen is placed on an arbitrary starting position of a (large) Chess board. Two players alternate in moving the Queen as in a game of Chess but with the restriction that the $L^1$ distance to the lower left corner, position $(0,0)$, must decrease. The player who moves there wins. Let $\phi =\frac{1+\sqrt{5}}{2}$, the golden ratio. READ MORE
-
3. Contributions to dual subgradient optimization and maintenance scheduling
Abstract : This thesis analyses two topics within the area of mathematical optimization; dual subgradient methods and maintenance optimization. The first two papers consider dual subgradient methods, and the third paper considers maintenance optimization. READ MORE
-
4. Optimization of Just-in-Time Sequencing Problems and Supply Chain Logistics
Abstract : This dissertation presents a comprehensive and comparative progress in sequencing approaches of mixed-model just-in-time (JIT) sequencing problem together with discrete apportioment problem (DAP). The goal of JIT sequencing problem (JITSP) is to keep the rate of usage of parts as constant as possible along the assembly lines, and the goal of DAP is to divide a given integer number of delegates proportionally among the states or the parties according to their population or votes. READ MORE
-
5. Analysis, synthesis and application of automaton-based constraint descriptions
Abstract : Constraint programming (CP) is a technology in which a combinatorial problem is modelled as a conjunction of constraints on variables ranging over given initial domains, and optionally an objective function on the variables. Such a model is given to a general-purpose solver performing systematic search to find constraint-satisfying domain values for the variables, giving an optimal value to the objective function. READ MORE