research
∙
03/22/2023
Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
The COVID-19 pandemic has been a recent example for the spread of a harm...
share
research
∙
11/23/2022
Exact solution approaches for the discrete α-neighbor p-center problem
The discrete α-neighbor p-center problem (d-α-pCP) is an emerging varian...
research
∙
07/11/2022
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
We study a class of integer bilevel programs with second-order cone cons...
research
∙
05/05/2022
A matheuristic for tri-objective binary integer programming
Many real-world optimisation problems involve multiple objectives. When ...
research
∙
11/26/2021
An Exact Method for Fortification Games
A fortification game (FG) is a three-level, two-player Stackelberg game,...
research
∙
11/12/2021
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
We study a class of bilevel integer programs with second-order cone cons...
research
∙
10/08/2021
On Solving the Minimum Common String Partition Problem by Decision Diagrams
In the Minimum Common String Partition Problem (MCSP), we are given two ...
research
∙
08/16/2021
A scaleable projection-based branch-and-cut algorithm for the p-center problem
The p-center problem (pCP) is a fundamental problem in location science,...
research
∙
06/01/2021
Experiments with graph convolutional networks for solving the vertex p-center problem
In the last few years, graph convolutional networks (GCN) have become a ...
research
∙
10/08/2019
A note on computational approaches for the antibandwidth problem
In this note, we consider the antibandwidth problem, also known as dual ...
research
∙
09/11/2019
An exact solution framework for the multiple gradual cover location problem
Facility and covering location models are key elements in many decision ...
research
∙
09/10/2019
