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 13 of 13 for “"Polyhedral study"”.

  1. A Polyhedral Study of Quadratic Traveling Salesman Problems

    … ATSP together with a quadratic cost function. We study the polytopes arising from a linearization of the respective quadratic integer programming formulations. Based on the proof of the dimension of the polytopes using the so called direct method we can prove the facetness of several valid …

    qucosa-diss

  2. Mixed n-Step MIR Inequalities, n-Step Conic MIR Inequalities and a Polyhedral Study of Single Row Facility Layout Problem

    … n-step conic MIR inequalities for the so-called polyhedral second-order conic (PSOC) mixed integer sets. PSOC sets arise in the polyhedral reformulation of SOCMIPs. We first introduce the n-step conic MIR inequality for a PSOC set with n integer variables and prove that all the 1-step to n-step …

    tamu Repository record for Mixed n-Step MIR Inequalities, n-Step Conic MIR Inequalities and a Polyhedral Study of Single Row Facility Layout Problem (opens in a new tab)

  3. The Steiner Linear Ordering Problem: Application to resource-constrained scheduling problems

    When examined through polyhedral study, the resource-constrained scheduling problems have always dealt with processes which have the same priority. With the Steiner Linear Ordering problem, we can address systems where the elements involved have different levels of priority, either high or low. …

    clemson Repository record for The Steiner Linear Ordering Problem: Application to resource-constrained scheduling problems (opens in a new tab)

  4. Polyhedral studies on scheduling and routing problems

    … achievements, mainly due to the use of so called polyhedral techniques, have established the importance of the polyhedral study for various combinatorial optimization problems. This thesis studies polyhedral structures of two well known combinatorial problems: (i) precedence constrained single …

    ubc Repository record for Polyhedral studies on scheduling and routing problems (opens in a new tab) Download PDF for Polyhedral studies on scheduling and routing problems (opens in a new tab)

  5. Integer programming approaches to networks with equal-split restrictions

    … specific applications. We are the first ones to study the problem as a general network flow problem and provide a polyhedral study. First we consider a general multi-commodity network flow problem with equal split restrictions. This problem is NP-hard in general. We perform a polyhedral study on …

    gatech Repository record for Integer programming approaches to networks with equal-split restrictions (opens in a new tab)

  6. Pairing inequalities and stochastic lot-sizing problems: A study in integer programming

    … of mathematical programming; specifically we study stochastic integer programming. We first study a simple and important stochastic integer programming problem, called stochastic uncapacitated lot-sizing (SLS), which is motivated by production planning under uncertainty. We describe a …

    gatech Repository record for Pairing inequalities and stochastic lot-sizing problems: A study in integer programming (opens in a new tab)

  7. Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem

    … In the first part of the dissertation, we study the polyhedral structure of the MMND problem. We summarize current literature on polyhedral study of MMND, which generates the family of the so-called cutset inequalities based on the traditional mixed integer rounding (MIR). We then introduce …

    tamu Repository record for Valid Inequalities and Facets for Multi-Module (Survivable) Capacitated Network Design Problem (opens in a new tab)

  8. Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization

    … sensor location have extensively motivated the study of subset selection. In this thesis, we propose new insights to two classical problems of these areas: the online bipartite matching problem and the constrained submodular function maximization problem. In the first part of this thesis, we …

    gatech Repository record for Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization (opens in a new tab)

  9. Topics in Packing and Scheduling

    … computing, to name a few. In this thesis we study three such models: dynamic node packing, interval scheduling with economies of scale, and temporal bin packing with half-capacity jobs; each extends on a well-known problem in packing and scheduling. While the problems are generally distinct, …

    gatech Repository record for Topics in Packing and Scheduling (opens in a new tab)

  10. Power Systems for Sustainability

    … approach to the DC optimal power flow problem. A polyhedral study related to a certain node-based relaxation of the Optimal Transmission Switching Problem is performed. An integral extended formulation of this substructure is constructed, and a practical approach to obtain valid inequalities is …

    gatech Repository record for Power Systems for Sustainability (opens in a new tab)

  11. Optimization in maritime inventory routing

    … solutions. Our final research contribution is a polyhedral study of an optimization problem that was motivated by maritime inventory routing, but is applicable to a more general class of problems. Numerous planning models within the chemical, petroleum, and process industries involve coordinating …

    gatech Repository record for Optimization in maritime inventory routing (opens in a new tab)

  12. Discrete Two-Stage Stochastic Mixed-Integer Programs with Applications to Airline Fleet Assignment and Workforce Planning Problems

    … even more challenging. In this dissertation, we study the class of two-stage stochastic mixed-integer programs (SMIP), which, as its name suggests, lies at the confluence of two formidable classes of problems. We design a novel algorithm for this class of problems, and also explore specialized …

    vt Repository record for Discrete Two-Stage Stochastic Mixed-Integer Programs with Applications to Airline Fleet Assignment and Workforce Planning Problems (opens in a new tab)