Month: February 2015

On imposing connectivity constraints in integer programs

  • Austin Buchanan
  • Sergiy Butenko
  • Yiming Wang
    • Categories Combinatorial Optimization, Network Optimization, Polyhedra

    In many network applications, one searches for a connected subset of vertices that exhibits other desirable properties. To this end, this paper studies the connected subgraph polytope of a graph, which is the convex hull of subsets of vertices that induce a connected subgraph. Much of our work is devoted to the study of two … Read more

    Monotonic bounds in multistage mixed-integer linear stochastic programming: theoretical and numerical results

  • Elisabetta Allevi
  • Marida Bertocchi
  • Francesca Maggioni
    • Categories Stochastic Programming

    Multistage stochastic programs bring computational complexity which may increase exponentially in real case problems. For this reason approximation techniques which replace the problem by a simpler one and provide lower and upper bounds to the optimal solution are very useful. In this paper we provide monotonic lower and upper bounds for the optimal objective value … Read more