research
∙
01/10/2023
Strong SDP based bounds on the cutwidth of a graph
Given a linear ordering of the vertices of a graph, the cutwidth of a ve...
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
∙
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
∙
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
∙
03/30/2020
On different Versions of the Exact Subgraph Hierarchy for the Stable Set Problem
One of many different hierarchies towards the stability number of a grap...
research
∙
02/14/2020
Relationship of k-Bend and Monotonic ℓ-Bend Edge Intersection Graphs of Paths on a Grid
If a graph G can be represented by means of paths on a grid, such that e...
research
∙
08/06/2019
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid
A graph G is called an edge intersection graph of paths on a grid if the...
research
∙
01/29/2019