16 citations · 33 across the 5 of their papers we have counts for
6 papers
On solving integer bilevel optimization problems with a non-convex quadratic follower objective function using disjunctive cuts
Kübra Tanınmış, Elisabeth Gaar, Jon Lee +2
In this work, we study bilevel optimization problems where all variables are integer, all constraints and the leader objective function are linear, and the follower objective funct…
The Multi-Commodity Flow Problem with Outsourcing Decisions
Elena Fernandez, Ivana Ljubic, Nicolas Zerega
We address a new prize-collecting problem of routing commodities in a given network with hub and non-hub nodes, in which the service of the non-hub nodes will be outsourced to thir…
Emerging Optimization Problems for Distribution in Same-day Delivery
Yuanyuan Li, Claudia Archetti, Ivana Ljubic
Same-day deliveries (SDD) have become a new standard to satisfy the "instant gratification" of online customers. Despite the existing powerful technologies deployed in last-mile de…
A bilevel approach for compensation and routing decisions in last-mile delivery
Martina Cerulli, Claudia Archetti, Elena Fernandez +1
In last-mile delivery logistics, peer-to-peer logistic platforms play an important role in connecting senders, customers, and independent carriers to fulfill delivery requests. Sin…
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
Elisabeth Gaar, Jon Lee, Ivana Ljubić +2
We study a class of bilevel integer programs with second-order cone constraints at the upper level and a convex quadratic objective and linear constraints at the lower level. We de…
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements
Eduardo Álvarez-Miranda, Marcos Goycoolea, Ivana Ljubić +1
The design of nature reserves is becoming, more and more, a crucial task for ensuring the conservation of endangered wildlife. In order to guarantee the preservation of species and…