16 citations · 24 across the 5 of their papers we have counts for
5 papers
An Exact Algorithm for the Max-Min Covering Location Blocker Problem
Yun-Tian Zhang, Chen Chen, Fabio Furini +1
We introduce the Max-Min Covering Location Blocker Problem, a bilevel optimization problem in which a leader blocks a minimum-cost set of candidate locations so that the optimal co…
An Integer Programming Approach to Compute Lower Bounds for Ramsey Numbers Using Circulant Graphs
Stefano Coniglio, Fabio Furini, Ivana Ljubić +3
The Ramsey number is the smallest order at which every red-blue edge coloring of a complete graph must contain a blue clique (a complete subgraph) of size or a red cli…
Mathematical Programming Formulations for the Collapsed k-Core Problem
Martina Cerulli, Domenico Serra, Carmine Sorgente +2
In social network analysis, the size of the k-core, i.e., the maximal induced subgraph of the network with minimum degree at least k, is frequently adopted as a typical metric to e…
Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates
Yuanyuan Li, Claudia Archetti, Ivana Ljubic
In this paper, we study a sequential decision-making problem faced by e-commerce carriers related to when to send out a vehicle from the central depot to serve customer requests, a…
An Exact Method for Fortification Games
Markus Leitner, Ivana Ljubić, Michele Monaci +2
A fortification game (FG) is a three-level, two-player Stackelberg game, also known as defender-attacker-defender game, in which at the uppermost level, the defender selects some a…