Alexander Veremyev

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 35

Top Topics

Integer Program

Related Problems

Betweenness Centrality

Top Venues

Eur. J. Oper. Res.

J. Glob. Optim.

Publications

Tomás Lagos, Oleg A. Prokopyev, Alexander Veremyev
Finding groups with maximum betweenness centrality via integer programming with random path sampling. J. Glob. Optim. 88 (1) (2024)
Dmytro Matsypura, Alexander Veremyev, Eduardo L. Pasiliao, Oleg A. Prokopyev
Finding the most degree-central walks and paths in a graph: Exact and heuristic approaches. Eur. J. Oper. Res. 308 (3) (2023)
Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao, Oleg A. Prokopyev
On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs. Eur. J. Oper. Res. 297 (1) (2022)
Alexander Veremyev, Mikhail V. Goubko
Mixed-Integer Approaches to Constrained Optimum Communication Spanning Tree Problem. CoRR (2021)
Colin P. Gillen, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
Fortification Against Cascade Propagation Under Uncertainty. INFORMS J. Comput. 33 (4) (2021)
Mikhail V. Goubko, Alexander Veremyev
Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees. Discret. Appl. Math. 305 (2021)
Cheng-Lung Chen, Qipeng P. Zheng, Alexander Veremyev, Eduardo L. Pasiliao, Vladimir Boginski
Failure Mitigation and Restoration in Interdependent Networks via Mixed-Integer Optimization. IEEE Trans. Netw. Sci. Eng. 8 (2) (2021)
JongEun Kim, Alexander Veremyev, Vladimir Boginski, Oleg A. Prokopyev
On the maximum small-world subgraph problem. Eur. J. Oper. Res. 280 (3) (2020)
Alexander Semenov, Alexander Veremyev, Eduardo L. Pasiliao, Vladimir Boginski
Double-Threshold Models for Network Influence Propagation. CSoNet (2020)
Mikhail V. Goubko, Alexander Veremyev
Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees. CoRR (2020)
Alexander Veremyev, Konstantin Pavlikov, Eduardo L. Pasiliao, My T. Thai, Vladimir Boginski
Critical nodes in interdependent networks with deterministic and probabilistic cascading failures. J. Glob. Optim. 74 (4) (2019)
Oleksandra Yezerska, Foad Mahdavi Pajouh, Alexander Veremyev, Sergiy Butenko
Exact algorithms for the minimum s-club partitioning problem. Ann. Oper. Res. 276 (1-2) (2019)
Alexander Veremyev, Alexander Semenov, Eduardo L. Pasiliao, Vladimir Boginski
Graph-based exploration and clustering analysis of semantic spaces. Appl. Netw. Sci. 4 (1) (2019)
Paul Balister, Béla Bollobás, Julian Sahasrabudhe, Alexander Veremyev
Dense subgraphs in random graphs. Discret. Appl. Math. 260 (2019)
Alexander Semenov, Alexander V. Mantzaris, Alexander G. Nikolaev, Alexander Veremyev, Jari Veijalainen, Eduardo L. Pasiliao, Vladimir Boginski
Exploring Social Media Network Landscape of Post-Soviet Space. IEEE Access 7 (2019)
Dmytro Matsypura, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
On exact solution approaches for the longest induced path problem. Eur. J. Oper. Res. 278 (2) (2019)
Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
Finding Critical Links for Closeness Centrality. INFORMS J. Comput. 31 (2) (2019)
Gabriel L. Zenarosa, Alexander Veremyev, Eduardo L. Pasiliao
Cascade of Edge Activation in Networks. CSoNet (2019)
Jose L. Walteros, Alexander Veremyev, Panos M. Pardalos, Eduardo L. Pasiliao
Detecting critical node structures on graphs: A mathematical programming approach. Networks 73 (1) (2019)
Colin P. Gillen, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
Critical arcs detection in influence networks. Networks 71 (4) (2018)
Grigory Pastukhov, Alexander Veremyev, Vladimir Boginski, Oleg A. Prokopyev
On maximum degree-based γ-quasi-clique problem: Complexity and exact approaches. Networks 71 (2) (2018)
Konstantin Pavlikov, Alexander Veremyev, Eduardo L. Pasiliao
Optimization of Value-at-Risk: computational aspects of MIP formulations. J. Oper. Res. Soc. 69 (5) (2018)
Alexander Semenov, Alexander Veremyev, Alexander G. Nikolaev, Eduardo L. Pasiliao, Vladimir Boginski
Ranking Academic Advisors: Analyzing Scientific Advising Impact Using MathGenealogy Social Network. CSoNet (2018)
Colin P. Gillen, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
Robustness of solutions to critical node detection problems with imperfect data: a computational study. Optim. Methods Softw. 32 (2) (2017)
Alla R. Kammerdiner, Alexander Veremyev, Eduardo L. Pasiliao
On Laplacian spectra of parametric families of closely connected networks with application to cooperative control. J. Glob. Optim. 67 (1-2) (2017)
Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
Finding groups with maximum betweenness centrality. Optim. Methods Softw. 32 (2) (2017)
Getachew K. Befekadu, Alexander Veremyev, Eduardo L. Pasiliao
Dynamic risk measures and related risk-averse decision problems. ACC (2017)
Tathagata Mukherjee, Alexander Veremyev, Piyush Kumar, Eduardo L. Pasiliao Jr.
The Minimum Edge Compact Spanner Network Design Problem. CoRR (2017)
Alexander Veremyev, Oleg A. Prokopyev, Sergiy Butenko, Eduardo L. Pasiliao
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs. Comput. Optim. Appl. 64 (1) (2016)
Zeynep Ertem, Alexander Veremyev, Sergiy Butenko
Detecting large cohesive subgroups with high clustering coefficients in social networks. Soc. Networks 46 (2016)
Alexander Semenov, Alexander G. Nikolaev, Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao
Analysis of Viral Advertisement Re-Posting Activity in Social Media. CSoNet (2016)
Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
Critical nodes for distance-based connectivity and related problems in graphs. Networks 66 (3) (2015)
Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao
Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra. J. Glob. Optim. 61 (1) (2015)
Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao
Potential energy principles in networked systems and their connections to optimization problems on graphs. Optim. Lett. 9 (3) (2015)
Chrysafis Vogiatzis, Alexander Veremyev, Eduardo L. Pasiliao, Panos M. Pardalos
An integer programming approach for finding the most and the least central cliques. Optim. Lett. 9 (4) (2015)
Alexander Veremyev, Peter Tsyurmasto, Stan Uryasev, R. Tyrrell Rockafellar
Calibrating probability distributions with convex-concave-convex functions: application to CDO pricing. Comput. Manag. Sci. 11 (4) (2014)
Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao
Exact identification of critical nodes in sparse networks via new compact formulations. Optim. Lett. 8 (4) (2014)
Alexander Veremyev, Oleg A. Prokopyev, Vladimir Boginski, Eduardo L. Pasiliao
Finding maximum subgraphs with relatively large vertex connectivity. Eur. J. Oper. Res. 239 (2) (2014)
Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
An integer programming framework for critical elements detection in graphs. J. Comb. Optim. 28 (1) (2014)
Alexander Veremyev, Alexey Sorokin, Vladimir Boginski, Eduardo L. Pasiliao
Minimum vertex cover problem for coupled interdependent networks with cascading failures. Eur. J. Oper. Res. 232 (3) (2014)
Grigory Pastukhov, Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao
Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks. J. Comb. Optim. 27 (3) (2014)
Jeffrey Pattillo, Alexander Veremyev, Sergiy Butenko, Vladimir Boginski
On the maximum quasi-clique problem. Discret. Appl. Math. 161 (1-2) (2013)
Alexander Veremyev, Vladimir Boginski
Identifying large robust network clusters via new compact formulations of maximum k-club problems. Eur. J. Oper. Res. 218 (2) (2012)