Similar Search Results

A shift-based model to solve the integrated staff rostering and task assignment problem with real-world requirements

Wang, Wenshu; Xie, Kexin; Guo, Siqi; Li, Weixing; Xiao, Fan - In: European journal of operational research : EJOR 310 (2023) 1, pp. 360-378

Persistent link: https://ebvufind01.dmz1.zbw.eu/10014340182

Bayesian model comparison based on expected posterior priors for discrete decomposable graphical models

Consonni, Guido; Lupparelli, Monia - 2009

The implementation of the Bayesian paradigm to model comparison can be problematic. In particular, prior distributions on the parameter space of each candidate model require special care. While it is well known that improper priors cannot be used routinely for Bayesian model comparison, we claim...

Persistent link: https://ebvufind01.dmz1.zbw.eu/10010343918

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

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

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

Clustered maximum weight clique problem : algorithms and empirical analysis

Malladi, Krishna Teja; Mitrovic-Minic, Snezana; Punnen, … - In: Computers & operations research : and their … 85 (2017), pp. 113-128

Persistent link: https://ebvufind01.dmz1.zbw.eu/10011713870

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

Detecting a most closeness-central clique in complex networks

Nasirian, Farzaneh; Mahdavi Pajouh, Foad; Balasundaram, … - In: European journal of operational research : EJOR 283 (2020) 2, pp. 461-475

Persistent link: https://ebvufind01.dmz1.zbw.eu/10012294843

Clique games : a family of games with coincidence between the nucleolus and the Shapley value

Trudeau, Christian; Vidal-Puga, Juan J. - In: Mathematical social sciences 103 (2020), pp. 8-14

Persistent link: https://ebvufind01.dmz1.zbw.eu/10012253669

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