Buscar
Mostrando ítems 1-10 de 26
Facet-generating procedures for the maximum-impact coloring polytope
(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
(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 ...
The Value of Observing the Buyer Arrival Time in Dynamic Pricing
(2020)
We consider a dynamic pricing problem where a firm sells one item to a single buyer in order to maximize expected revenues. The firm commits to a price function over an infinite horizon. The buyer arrives at some random ...
Government Turnover and External Financial Assistance
(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, ...
A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows
(European Journal of Operational ResearchElsevier, 2024)
The adoption of electric vehicles (EVs) within last-mile deliveries is considered one of the key transformations towards more sustainable logistics. The inclusion of EVs introduces new operational constraints to the models ...
Solving the Traveling Salesman Problem with release dates via branch and cut
(EURO Journal on Transportation and Logistics (ISSN 2192-4384)Elsevier, 2023)
In this paper we study the Traveling Salesman Problem with release dates (TSP-rd) and completion time
minimization. The TSP-rd considers a single vehicle and a set of customers that must be served exactly
once with goods ...
A polyhedral study of a relaxation of the routing and spectrum allocation problem
(Procedia Computer ScienceElsevier, 2023)
The routing and spectrum allocation (RSA) problem arises in the context of flexible grid optical networks, and consists in routing
a set of demands through a network while simultaneously assigning a bandwidth to each ...
Multiobjective formulation for last-mile optimization in wireless networks
(IEEE2023 XLIX Latin American Computer Conference (CLEI), 2023)
Internet of Things (IoT) is a technology that serves as the basis for smart environments. The ever-expanding set of applications that provide intelligence in different scenarios is continually growing and expanding. From ...
Demand Estimation under Uncertain Consideration Sets
(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 ...
A Value-Based Well-Being Framework
(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 ...