Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"Combinatorial enumeration problems"”.
-
A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem
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 …
-
An analytic approach to problems connected with plane tree enumeration
<p>Combinatorics involves a wide range of enumeration problems. Many such problems have some characteristics in common. As an example, various structures can be related to a set of plane trees that has eliminated all trees that contain any element of a defined set of forbidden substructures. In …