The Star Degree Centrality Problem: A Decomposition Approach
From MaRDI portal
Publication:5084632
DOI10.1287/ijoc.2021.1074zbMath1492.90026OpenAlexW3198791815MaRDI QIDQ5084632
Chrysafis Vogiatzis, Thomas C. Sharkey, Mustafa Can Camur
Publication date: 28 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1074
Related Items (1)
Uses Software
Cites Work
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Finding clique clusters with the highest betweenness centrality
- Partitioning procedures for solving mixed-variables programming problems
- On the number of graphs without 4-cycles
- On using approximations of the Benders master problem
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures
- Maximum independent sets near the upper bound
- Centers of complex networks
- Detecting a most closeness-central clique in complex networks
- A survey of computational methods in protein-protein interaction networks
- Logic-based Benders decomposition for scheduling a batching machine
- An integer programming approach for finding the most and the least central cliques
- Counting independent sets in graphs
- Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- Integrated Airline Schedule Design and Fleet Assignment: Polyhedral Analysis and Benders' Decomposition Approach
- Combinatorial Benders Cuts for the Minimum Tollbooth Problem
- Benders Decomposition for Production Routing Under Demand Uncertainty
- The centrality of groups and classes
- Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
- Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks
- Finding groups with maximum betweenness centrality
This page was built for publication: The Star Degree Centrality Problem: A Decomposition Approach
