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 8 of 8 for “"Enumeration algorithm"”.
-
A group theoretic-implicit enumeration algorithm for the traveling salesman problem.
Massachusetts Institute of Technology, Alfred P. Sloan School of Management. Thesis. 1968. M.S.
-
A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem
… 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.
-
Balancing a job shop with alternative computer-aided time standards
… time standards. Three machine loading algorithms are proposed to perform the workload balance, and the effectiveness of the algorithms is tested through the results of a computer simulation. It is shown that an algorithm which is unique to the literature produces results which approach …
-
Otimização de redes de distribuição de água: estudo de dois modelos
… programming problem, which is solved by implicit enumeration algorithm and by dual decomposition algorithm. The other model seeks optimization of the network by heuristic search of optimal diameters, based on energy costs necessary to elevation of piezometric height of the network source nodes. In …
-
Towards characterizing the solution space of the 1-Dollo Phylogeny problem
… model, exist for the observations. Current algorithms to solve the 1-Dollo Phylogeny problem only tell us whether or not a set of observations has a 1-Dollo phylogeny by outputting a single solution. We explore the structure of 1-Dollo phylogenies and use our idea of a skeleton to develop an …
-
Enumeration of polyhedral graphs
… is concerned with the design of a polyhedron enumeration algorithm. The approach taken focuses on specic classes of polyhedra and their graph theoretic properties. This is then compared more broadly to other graph enumeration algorithms that are concerned with the same or a superset which …
-
The mixed-integer bilinear programming problem with extensions to zero-one quadratic programs
… a composite Lagrangian relaxation-implicit enumeration-cutting plane algorithm is developed. Extensive computational experience is provided to test the efficiency of various algorithmic strategies and the effects of problem data on the computational effort of the proposed algorithm. The …
-
A Combinatorial Framework for Multiple RNA Interaction Prediction
… recent developments in RNA-RNA interaction algorithms. However, biological mechanisms in which more than two RNAs take part in an interaction also exist.</p> <p>A typical algorithmic approach to such problems is to find the minimum energy structure. Often the computationally optimal solution …