Narrow search
Showing 1 - 6 of 6
Cover Image
Valid inequalities and separation algorithms for the set partitioning problem
Groiez, Mounira; Desaulniers, Guy; Marcotte, Odile - In: INFOR : information systems and operational research 52 (2014) 4, pp. 185-196
Persistent link: https://ebvufind01.dmz1.zbw.eu/10011415160
Cover Image
Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs
Zhou, Yi; Rossi, André; Hao, Jin-Kao - In: European journal of operational research : EJOR 269 (2018) 3, pp. 834-843
Persistent link: https://ebvufind01.dmz1.zbw.eu/10011866668
Cover Image
Finding clique clusters with the highest betweenness centrality
Rysz, Maciej; Mahdavi Pajouh, Foad; Pasiliao, Eduardo L. - In: European journal of operational research : EJOR 271 (2018) 1, pp. 155-164
Persistent link: https://ebvufind01.dmz1.zbw.eu/10011882787
Cover Image
A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs
Nogueira, Bruno; Pinheiro, Rian G. S. - In: Computers & operations research : and their … 90 (2018), pp. 232-248
Persistent link: https://ebvufind01.dmz1.zbw.eu/10011775341
Cover Image
Finding influential groups in networked systems : the most degree-central clique problem
Zhong, Haonan; Mahdavi Pajouh, Foad; Prokopyev, Oleg - In: Omega : the international journal of management science 101 (2021), pp. 1-13
Persistent link: https://ebvufind01.dmz1.zbw.eu/10012494674
Cover Image
A PTAS for the disk cover problem of geometric objects
Rezende, Pedro J. de; Miyazawa, Flávio K.; Sasaki, … - In: Operations research letters 41 (2013) 5, pp. 552-555
Persistent link: https://ebvufind01.dmz1.zbw.eu/10010191951