3 papers
math.OC2024
On Integer Programs with Irrational Data
Seyedmohammadhossein Hosseinian, Andrew J. Schaefer
An integer program (IP) with a finite number of feasible solutions may have an unbounded linear programming relaxation if it contains irrational parameters, due to implicit constra…
math.CO2021
An Improved Approximation for Maximum -Dependent Set on Bipartite Graphs
Seyedmohammadhossein Hosseinian, Sergiy Butenko
We present a -approximation algorithm for the Maximum -dependent Set problem on bipartite graphs for any . For a graph with vertices and edges,…
math.OC2019
Polyhedral Properties of the Induced Cluster Subgraphs
Seyedmohammadhossein Hosseinian, Sergiy Butenko
A cluster graph is a graph whose every connected component is a complete graph. Given a simple undirected graph , a subset of vertices inducing a cluster graph is called an inde…