Integer Programming

Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems

  • Stefano Coniglio
  • Fabio Furini
  • Ivana Ljubić
    • Categories Cutting Plane Approaches, Integer Programming, Nonlinear Optimization Tags , ,

    We study a family of discrete optimization problems asking for the maximization of the expected value of a concave, strictly increasing, and differentiable function composed with a set-union operator. The expected value is computed with respect to a set of coefficients taking values from a discrete set of scenarios. The function models the utility function … Read more

    On a class of stochastic programs with exponentially many scenarios

  • Gustavo Angulo
    • Categories (Mixed) Integer Linear Programming, Polyhedra, Stochastic Programming Tags , ,

    We consider a class of stochastic programs whose uncertain data has an exponential number of possible outcomes, where scenarios are affinely parametrized by the vertices of a tractable binary polytope. Under these conditions, we propose a novel formulation that introduces a modest number of additional variables and a class of inequalities that can be efficiently … Read more

    An MISOCP-Based Solution Approach to the Reactive Optimal Power Flow Problem

  • Sezen Ece Kayacık
  • Burak Kocuk
    • Categories (Mixed) Integer Nonlinear Programming, Applications - Science and Engineering

    In this letter, we present an alternative mixed-integer non-liner programming formulation of the reactive optimal power flow (ROPF) problem. We utilize a mixed-integer second-order cone programming (MISOCP) based approach to find global optimal solutions of the proposed ROPF problem formulation. We strengthen the MISOCP relaxation via the addition of convex envelopes and cutting planes. Computational … Read more

    Distributionally Robust Optimization Approaches for a Stochastic Mobile Facility Routing and Scheduling Problem

  • Karmel S. Shehadeh
    • Categories (Mixed) Integer Linear Programming, Facility Planning and Design, Robust Optimization Tags , , , ,

    We study a mobile facility (MF) routing and scheduling problem in which probability distributions of the time-dependent demand for MF services is unknown. To address distributional ambiguity, we propose and analyze two distributionally robust MF routing and scheduling (DMFRS) models that seek to minimize the fixed cost of establishing the MF fleet and maximum expected … Read more

    The SCIP Optimization Suite 7.0

  • Daniel Anderson
  • Ksenia Bestuzheva
  • Wei-Kun Chen
  • Leon Eifler
  • Gerald Gamrath
  • Maxime Gasse
  • Ambros Gleixner
  • Gregor Hendel
  • Christopher Hojny
  • Thorsten Koch
  • Pierre Le Bodic
  • Stephen J. Maher
  • Frederic Matter
  • Matthias Miltenberger
  • Marc E. Pfetsch
  • Felipe Serrano
  • Dieter Weninger
  • Jakob Witzig
  • Patrick Gemander
  • Leona Gottwald
  • Katrin Halbig
  • Erik Mühmer
  • Benjamin Müller
  • Franziska Schlösser
  • Yuji Shinano
  • Christine Tawfik
  • Stefan Vigerske
  • Fabian Wegscheider
    • Categories (Mixed) Integer Linear Programming, (Mixed) Integer Nonlinear Programming Tags , , , , , , , , , , , , ,

    The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP. This paper discusses enhancements and extensions contained in version 7.0 of the SCIP Optimization Suite. The new version features the parallel presolving library PaPILO as a new addition to the suite. PaPILO 1.0 simplifies … Read more

    Distributionally Robust Chance-Constrained Programs with Right-Hand Side Uncertainty under Wasserstein Ambiguity

  • Nam Ho-Nguyen
  • Fatma Kılınç-Karzan
  • Simge Küçükyavuz
  • Dabeen Lee
    • Categories (Mixed) Integer Linear Programming, Stochastic Programming Tags , , ,

    We consider exact deterministic mixed-integer programming (MIP) reformulations of distributionally robust chance-constrained programs (DR-CCP) with random right-hand sides over Wasserstein ambiguity sets. The existing MIP formulations are known to have weak continuous relaxation bounds, and, consequently, for hard instances with small radius, or with a large number of scenarios, the branch-and-bound based solution processes suffer … Read more

    A numerical study of transformed mixed-integer optimal control problems

  • Sebastian Sager
  • Manuel Tetschke
  • Clemens Zeile
    • Categories (Mixed) Integer Nonlinear Programming, Global Optimization Theory, Systems governed by Differential Equations Optimization Tags , , , ,

    Time transformation is a ubiquitous tool in theoretical sciences, especially in physics. It can also be used to transform switched optimal con trol problems into control problems with a fixed switching order and purely continuous decisions. This approach is known either as enhanced time transformation, time-scaling, or switching time optimization (STO) for mixed-integer optimal control. … Read more

    Stability in the the Hospitals / Residents problem with Couples and Ties: Mathematical models and computational studies

  • Maxence Delorme
  • Jacek Gondzio
  • William Pettersson
  • Sergio García
  • Joerg Kalcsics
  • David Manlove
    • Categories Applications - OR and Management Sciences, Combinatorial Optimization, Integer Programming Tags , , ,

    In the well-known Hospitals/Residents problem (HR), the objective is to find a stable matching of doctors (or residents) to hospitals based on their preference lists. In this paper, we study HRCT, the extension of HR in which doctors are allowed to apply in couples, and in which doctors and hospitals can include ties in their … Read more

    The Star Degree Centrality Problem: A Decomposition Approach

  • Mustafa Can Camur
  • Thomas C. Sharkey
  • Chrysafis Vogiatzis
    • Categories 0-1 Programming, Cutting Plane Approaches, Network Optimization Tags , ,

    We consider the problem of identifying the induced star with the largest cardinality open neighborhood in a graph. This problem, also known as the star degree centrality (SDC) problem, has been shown to be 𝒩𝒫-complete. In this work, we first propose a new integer programming (IP) formulation, which has a fewer number of constraints and … Read more

    A note on the Lasserre hierarchy for different formulations of the maximum independent set problem

  • Miguel F. Anjos
  • Youssouf Emine
  • Andrea Lodi
  • Zhao Sun
    • Categories Integer Programming, Linear, Cone and Semidefinite Programming, Network Optimization Tags , , ,

    In this note, we consider several polynomial optimization formulations of the max- imum independent set problem and the use of the Lasserre hierarchy with these different formulations. We demonstrate using computational experiments that the choice of formulation may have a significant impact on the resulting bounds. We also provide theoretical justifications for the observed behavior. … Read more