Now showing items 15-21 of 22

    • A branch-and-cut algorithm for the routing and spectrum allocation problem 

      Marenco, Javier; Bianchetti, Marcelo (Universidad Torcuato Di Tella, 2023)
      One of the most promising solutions to deal with huge data traffic demands in large communication networks is given by flexible optical networking, in particular the flexible grid (flexgrid) technology specified in the ...
    • An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers 

      Marenco, Javier (Universidad Torcuato Di Tella, 2023)
      We present a mixed integer programming formulation for the problem of clustering a set of points in Rd with axis-parallel clusters, while allowing to discard a pre-specified number of points, thus declared to be outliers. ...
    • A Value-Based Well-Being Framework 

      Pels, Jaqueline; Mele, Cristina; Russo-Spena, Tiziana; Tregua, Marco (Journal of MacromarketingSAGE, 2023)
      This article presents and illustrates a novel value-based well-being framework, derived from service-dominant logic notions of the link between value and well-being. Based in a wide range of disciplines, this framework ...
    • Demand Estimation under Uncertain Consideration Sets 

      Vulcano, Gustavo; Jagabathula, Srikanth; Mitrofanov, Dmitry (Operations Research (ISSN: 0030-364X), 2023-09)
      To estimate customer demand, choice models rely both on what the individuals do and do not purchase. A customer may not purchase a product because it was not offered but also because it was not considered. To account for ...
    • Government Turnover and External Financial Assistance 

      Gago, Andrés; Abad, José María; Bermejo, Vicente J.; Carozzi, Felipe (Universidad Torcuato Di Tella, 2023)
      We study the political incentives shaping governments’ decisions to seek assistance from a lender of last resort. We propose that re-elected incumbents are more reluctant than newly elected governments to request assistance, ...
    • Facet-generating procedures for the maximum-impact coloring polytope 

      Marenco, Javier; Braga, Mónica (2023)
      Given two graphs G = (V, EG) and H = (V, EH) over the same set of vertices and given a set of colors C, the impact on H of a coloring c : V → C of G, denoted I(c), is the number of edges ij ∈ EH such that c(i) = c(j). ...
    • The maximum 2D subarray polytope: facet-inducing inequalities and polyhedral computations 

      Marenco, Javier; Koch, Ivo (2022)
      Given a matrix with real-valued entries, the maximum 2D subarray problem consists in finding a rectangular submatrix with consecutive rows and columns maximizing the sum of its entries. In this work we start a polyhedral ...