Skip to content

Author

I. Ljubić

We have 2 of 138 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

An Exact Algorithm for the Max-Min Covering Location Blocker Problem

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 coverage of a budget-constrained follower does not exceed a prescribed target. Each customer's coverage is determined by the least favorable o...

Yun-Tian Zhang, Chen Chen, Fabio Furini et al. · 0 citations
#edge computing Preprint Aug 2026

An Integer Programming Approach to Compute Lower Bounds for Ramsey Numbers Using Circulant Graphs

The Ramsey number $R(m,n)$ 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 $m$ or a red clique of size $n$. Determining these numbers exactly is extremely hard, and even certifying a lower bound requires exhibiting an explicit colo...

Stefano Coniglio, Fabio Furini, I. Ljubić et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.