The star degree centrality problem: a decomposition approach
From MaRDI portal
Publication:5084632
DOI10.1287/IJOC.2021.1074zbMATH Open1492.90026OpenAlexW3198791815MaRDI QIDQ5084632FDOQ5084632
Authors: Mustafa Can Camur, Thomas C. Sharkey, Chrysafis Vogiatzis 
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
Recommendations
- On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem
- Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks
- scientific article; zbMATH DE number 5126095
- Induced star partition of graphs
- Star partitions on graphs
Cites Work
- The centrality of groups and classes
- Partitioning procedures for solving mixed-variables programming problems
- Benders decomposition for large-scale uncapacitated hub location
- An integer programming approach for finding the most and the least central cliques
- On the number of graphs without 4-cycles
- On using approximations of the Benders master problem
- Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
- Combinatorial Benders cuts for the minimum tollbooth problem
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures
- Benders decomposition for production routing under demand uncertainty
- Centers of complex networks
- Counting independent sets in graphs
- Integrated airline schedule design and fleet assignment: polyhedral analysis and Benders' decomposition approach
- Detecting a most closeness-central clique in complex networks
- Finding groups with maximum betweenness centrality
- Finding clique clusters with the highest betweenness centrality
- Maximum independent sets near the upper bound
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Accelerating the Benders decomposition method: application to stochastic network design problems
- A survey of computational methods in protein-protein interaction networks
- Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks
- Logic-based Benders decomposition for scheduling a batching machine
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
Cited In (2)
Uses Software
This page was built for publication: The star degree centrality problem: a decomposition approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084632)
