Similar Search Results

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

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

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

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

A Book of Open Shop Scheduling : Algorithms, Complexity and Applications

Kubiak, Wieslaw - 2022

Chapter 1: Preliminaries -- Chapter 2: Makespan minimization for two-machine open shops -- Chapter 3: General open shop scheduling -- Chapter 4: Multiprocessor operations -- Chapter 5: Concurrent open shops -- Chapter 6: Open shop scheduling with simultaneity constraints -- Chapter 7:...

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