The stochastic pseudo-star degree centrality problem

DOI10.1016/j.ejor.2022.11.042OpenAlexW4309928417MaRDI QIDQ6112539

Mustafa Can Camur, Chrysafis Vogiatzis, Thomas C. Sharkey

Publication date: 10 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.11.042

zbMATH Keywords

integer programmingbenders decompositionprotein-protein interaction networksnetwork analysis with biological applicationsprobabilistic group-based centrality

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Benders decomposition without separability: a computational study for capacitated facility location problems
• Maximizing a class of submodular utility functions
• Finding clique clusters with the highest betweenness centrality
• Structure connectivity and substructure connectivity of star graphs
• Facet defining inequalities among graph invariants: The system graphedron
• A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
• Partitioning procedures for solving mixed-variables programming problems
• Arrangement graphs: A class of generalized star graphs
• Logic-based Benders decomposition
• Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
• Combined social networks and data envelopment analysis for ranking
• Tree optimization based heuristics and metaheuristics in network construction problems
• Declawing a graph: polyhedra and branch-and-cut algorithms
• Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect
• A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network
• Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
• A survey of hybrid metaheuristics for the resource-constrained project scheduling problem
• Iterated greedy for the maximum diversity problem
• Detecting a most closeness-central clique in complex networks
• Where in the supply chain network does ISO 9001 improve firm productivity?
• A survey of computational methods in protein-protein interaction networks
• Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems
• A group-theoretic model for symmetric interconnection networks
• The centrality of groups and classes
• Full‐load route planning for balancing bike sharing systems by logic‐based benders decomposition
• Implementing Automatic Benders Decomposition in a Modern MIP Solver
• Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling
• The Star Degree Centrality Problem: A Decomposition Approach
• Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition
• An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
• Finding Critical Links for Closeness Centrality
• Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks
• TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPH
• Collective dynamics of ‘small-world’ networks

This page was built for publication: The stochastic pseudo-star degree centrality problem