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 11 of 11 for “"Mixed integer rounding"”.

  1. Split Cuts From Sparse Disjunctions

    … are one of the major techniques used in solving Mixed-Integer Linear Programming (MIP) models. Various types of cuts have long been exploited by MIP solvers, leading to state-of-the-art performance in practice. Among them, the class of split cuts, which includes Gomory Mixed Integer (GMI) and …

    waterloo Repository record for Split Cuts From Sparse Disjunctions (opens in a new tab)

  2. Cutting Planes for Large Mixed Integer Programming Models

    … this thesis I focus on cutting planes for large Mixed Integer Programming (MIP) problems. More specifically, I focus on two independent cutting planes studies. The first of these deals with cutting planes for the Traveling Salesman Problem (TSP), and the second with cutting planes for general …

    gatech Repository record for Cutting Planes for Large Mixed Integer Programming Models (opens in a new tab)

  3. Single-row mixed-integer programs: theory and computations

    Single-row mixed-integer programming (MIP) problems have been studied thoroughly under many different perspectives over the years. While not many practical applications can be modeled as a single-row MIP, their importance lies in the fact that they are simple, natural and very useful relaxations of …

    gatech Repository record for Single-row mixed-integer programs: theory and computations (opens in a new tab)

  4. Ein heuristisches Dekompositionsverfahren für mehrstufige Losgrößenprobleme

    … der Literatur bekannten (l,S)-Ungleichungen und Mixed-Integer-Rounding- Inequalities hinzugefügt. Zudem wurden die Teilmodelle um Restriktionen ergänzt, die die Rüstanzahl nach unten beschränken oder solchen, die sich aus Überlegungen zu Restkapazitäten ergeben. Sofern Rüstzeiten vorhanden sind, …

    fu-berlin Repository record for Ein heuristisches Dekompositionsverfahren für mehrstufige Losgrößenprobleme (opens in a new tab)

  5. Exploring Structure and Reformulations in Different Integer Programming Algorithms

    … using problem reformulations in order to solve integer programs, i.e. optimization problems in which the decision variables must be integer. We first consider the polyhedral approach. We start by addressing the ques- tion of lifting valid inequalities, i.e. finding a valid inequality for a set Y …

    liege Repository record for Exploring Structure and Reformulations in Different Integer Programming Algorithms (opens in a new tab) Download PDF for Exploring Structure and Reformulations in Different Integer Programming Algorithms (opens in a new tab)

  6. Cuts in Optimization and Approximation: Generalized MIR Cutting Plane and Integrality Gap Bounds for the Planar Multicut Problem

    … themes, both centered around the role of cuts in integer programming and approximation algorithms. In the first part, we investigate the complexity of split closures in mixed-integer sets in~$\mathbb{R}^3$ with two integral variables and one continuous variable. While it is known that …

    waterloo Repository record for Cuts in Optimization and Approximation: Generalized MIR Cutting Plane and Integrality Gap Bounds for the Planar Multicut Problem (opens in a new tab)

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

    … of valid inequalities for general linear mixed integer programs (MIPs) and second-order conic MIPs (SOCMIPs) and establish several theoretical properties and computational effectiveness of these inequalities. First we introduce the mixed n-step mixed integer rounding (MIR) inequalities for …

    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)

  8. Stochastic Optimization Models for Perishable Products

    … models, including a two-stage stochastic mixed integer linear program, a two-stage stochastic mixed integer non linear program, and a chance constraint program are proposed to capture uncertainties. The objective is to minimize the total replenishment costs which impact prots and service …

    clemson Repository record for Stochastic Optimization Models for Perishable Products (opens in a new tab)

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

    … cutset inequalities based on the traditional mixed integer rounding (MIR). We then introduce a new family of inequalities for MMND based on the so-called n-step MIR, and show that various classes of cutset inequalities in the literature are special cases of these inequalities. We do so by …

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

  10. Facets for Continuous Multi-Mixing Set and Its Generalizations: Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem

    … for several new multi-parameter multi-constraint mixed integer sets. These valid inequalities result in cutting planes that significantly improve the efficiency of algorithms for solving mixed integer programming (MIP) problems involving multimodule capacity constraints. These MIPs arise in many …

    tamu Repository record for Facets for Continuous Multi-Mixing Set and Its Generalizations: Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem (opens in a new tab)

  11. Two-Stage Stochastic Mixed Integer Nonlinear Programming: Theory, Algorithms, and Applications

    … that allows probabilistic data parameters in mixed integer programming, a well-known tool for optimization modeling with deterministic input data. However, akin to the mixed integer programs, these stochastic models are theoretically intractable and computationally challenging to solve because …

    vt Repository record for Two-Stage Stochastic Mixed Integer Nonlinear Programming: Theory, Algorithms, and Applications (opens in a new tab)