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 6 of 6 for “"compact formulation"”.
-
Análise por computadores digitais de estruturas reticuladas no espaço, com elemento de secção variável
… stiffness matrix are made in arder to obtain a compact formulation for the problem without loss in generality. These arrangements allow the introduction of hinged members with non-uniform cross section. Also, by using well known techniques , the prograrn allow the introduction of elastic …
-
An Investigation of Computer-Aided Analysis for Switched Capacitor Sampled-Data Filters
… SC circuits in order to produce an efficient and compact formulation for machine programming and computation. The second technique is based on modified nodal analysis (MNA) approach. The advantage of this approach over the block partitioning approach is that it can be applied to more general …
-
Material transport system design in manufacturing
… costs, arc capacities, and empty travel in our formulations. We propose two solution approaches for the MTSDP. The first is the compact formulation (CF) approach where the three major decisions are handled by a mixed integer non-linear programming (MINLP) formulation. Relaxation techniques are …
-
Embeddings for Disjunctive Programs with Applications to Political Districting and Rectangle Packing
… to the problem via a reduced-dimensional reformulation, the Karash-Kuhn-Tucker optimality conditions, and gradient descent. The second chapter covers a more complete form of the political districting problem. We attempt to overcome the non-convex objective function and combinatorially …
-
Integrated Aircraft Fleeting, Routing, and Crew Pairing Models and Algorithms for the Airline Industry
… for solving this problem adopt set partitioning formulations that include exponentially many variables, thus requiring the design of specialized column generation or branch-and-price algorithms. In this dissertation, however, we present a novel compact polynomially sized representation for the …
-
Tight Flow-Based Formulations for the Asymmetric Traveling Salesman Problem and Their Applications to some Scheduling Problems
… is devoted to the development of new flow-based formulations for the asymmetric traveling salesman problem (ATSP) and to the demonstration of their applicability in effectively solving some scheduling problems. The ATSP is commonly encountered in the areas of manufacturing planning and …