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 10 of 10 for “"Polyhedral analysis"”.

  1. Disjunctive invariants for modular static analysis

    We study the application of modular static analysis to prove program safety and detection of program errors. The analyses proposed in this thesis benefit from the relationship between a modular analyzer and a precise disjunctive domain. A modular analyzer requires a precise abstract domain to …

    nus Repository record for Disjunctive invariants for modular static analysis (opens in a new tab) Download file for Disjunctive invariants for modular static analysis (opens in a new tab)

  2. Independence systems and stable set relaxations

    … sets. This thesis studies co-k-plexes from polyhedral, algorithmic, and enumerative perspectives. The polyhedral analysis explores the relationship between the stable set polytope and co-k-plex polyhedra. Results include generalizations of odd holes, webs, wheels, and the claw. Sufficient …

    rice Repository record for Independence systems and stable set relaxations (opens in a new tab)

  3. Optimization Methods for Cluster Analysis in Network-based Data Mining

    … we present the results of a comprehensive polyhedral analysis. We derive several families of facet-defining valid inequalities for the IUC polytope associated with a graph. We also provide a complete description of this polytope for some special classes of graphs. We establish computational …

    tamu Repository record for Optimization Methods for Cluster Analysis in Network-based Data Mining (opens in a new tab)

  4. Parallelization of dynamic programming recurrences in computational biology

    … abstraction to represent dynamic programming and polyhedral analysis to exploit parallelism. We suggest a novel technique within the polyhedral model to optimize for throughput by pipelining independent computations on an array. This design technique improves on the state of the art, which builds …

    wustl Repository record for Parallelization of dynamic programming recurrences in computational biology (opens in a new tab)

  5. Topics in linear and nonlinear discrete optimization

    … of these structured problems. We provide polyhedral analysis together with separation for solving our variant of this minimization subproblem, containing binary and bounded continuous variables. Our novel mixed hyperedge method allows to outperform modern commercial MIP software, providing …

    gatech Repository record for Topics in linear and nonlinear discrete optimization (opens in a new tab)

  6. Exact Approaches for Higher-Dimensional Orthogonal Packing and Related Problems

    … linear programming model, which we subject to polyhedral analysis. Furthermore, we establish general non-overlapping and density inequalities and prove under appropriate assumptions their facet-defining property for the convex hull of the integer solutions. Based on the proposed model and the …

    qucosa-diss

  7. Optimization Algorithms for the Flight Planning Problem

    … gap of less than 1%. Finally, we conduct a polyhedral analysis of the Path Avoiding Forbidden Pairs polytope, motivated by the study of complex traffic restrictions present in the Flight Planning Problem. Under certain conditions, we are able to provide a complete linear description of the …

    fu-berlin Repository record for Optimization Algorithms for the Flight Planning Problem (opens in a new tab)

  8. Integrated Airline Operations: Schedule Design, Fleet Assignment, Aircraft Routing, and Crew Scheduling

    … demands pertaining to multiple fare-classes. A polyhedral analysis of the proposed mixed-integer programming model is used to derive several classes of valid inequalities for tightening its representation. Solution approaches are developed by applying Benders decomposition method to the …

    vt Repository record for Integrated Airline Operations: Schedule Design, Fleet Assignment, Aircraft Routing, and Crew Scheduling (opens in a new tab)

  9. 2-sided and multi-sided stable matchings: structures, algorithms, and applications

    This thesis examines the Stable Matching problem (SM) and some of its most important variants, namely the Stable Admissions (SAX the many-to-many Stable Matching (MM), and the Chain Stable Network problem. In the context of the SM, a time-optimal algorithm is provided that identifies which of the …

    greece Repository record for 2-sided and multi-sided stable matchings: structures, algorithms, and applications (opens in a new tab)

  10. Enhanced Formulations for Minimax and Discrete Optimization Problems with Applications to Scheduling and Routing

    … and scheduling problems. We conduct an extensive polyhedral analysis of this problem in order to tighten its representation using the Reformulation-Linearization/Convexification Technique (RLT), and demonstrate the benefits of the resulting lifted formulations for several classes of problems. …

    vt Repository record for Enhanced Formulations for Minimax and Discrete Optimization Problems with Applications to Scheduling and Routing (opens in a new tab)