Finding the most degree-central walks and paths in a graph : exact and heuristic approaches
Year of publication: |
2023
|
---|---|
Authors: | Matsypura, Dmytro ; Veremyev, Alexander ; Pasiliao, Eduardo L. ; Prokopyev, Oleg |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 308.2023, 3 (1.8.), p. 1021-1036
|
Subject: | Degree centrality | Group centrality | Mixed-integer programming | Network analysis | Networks | Graphentheorie | Graph theory | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming | Unternehmensnetzwerk | Business network | Netzplantechnik | Project network techniques | Netzwerk | Network |
-
Finding influential groups in networked systems : the most degree-central clique problem
Zhong, Haonan, (2021)
-
A network simplex method for the budget-constrained minimum cost flow problem
Holzhauser, Michael, (2017)
-
Exact and heuristic algorithms for the design of hub networks with multiple lines
Martins de Sá, Elisangela, (2015)
- More ...
-
On exact solution approaches for the longest induced path problem
Matsypura, Dmytro, (2019)
-
Finding critical links for closeness centrality
Veremyev, Alexander, (2019)
-
Fortification against cascade propagation under uncertainty
Gillen, Colin P., (2021)
- More ...