An ellipsoidal bounding scheme for the quasi-clique number of a graph

von Miao, Zhuqi
Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2020)

Detecting large risk-averse 2-clubs in graphs with random edge failures

von Mahdavi Pajouh, Foad
Veröffentlicht in Applied optimization and data mining (2017)

A branch-and-bound approach for maximum quasi-cliques

von Mahdavi Pajouh, Foad
Veröffentlicht in Data mining and informatics (2014)

Graph signatures : identification and optimization

von Balasundaram, Balabhaskar
Veröffentlicht in European journal of operational research (2022)

Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes

von Balasundaram, Balabhaskar
Veröffentlicht in Optimization letters (2010)

Graph signatures : identification and optimization

von Balasundaram, Balabhaskar
Veröffentlicht in European journal of operational research (2022)

Detecting a most closeness-central clique in complex networks

von Nasirian, Farzaneh
Veröffentlicht in European journal of operational research (2020)

On the 2-club polytope of graphs

von Mahdavi Pajouh, Foad
Veröffentlicht in Operations research (-2016)

The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures

von Ma, Juan
Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2016)

A specialty steel bar company uses analytics to determine available-to-promise dates

Veröffentlicht in Interfaces (2013)