Narrow search
Showing 1 - 7 of 7
Cover Image
A tutorial on branch and cut algorithms for the maximum stable set problem
Rebennack, Steffen; Reinelt, Gerhard; Pardalos, Panos M. - In: International transactions in operational research : … 19 (2012) 1/2, pp. 161-199
Persistent link: https://www.econbiz.de/10015177410
Cover Image
A combinatorial algorithm for the TDMA message scheduling problem
Commander, Clayton W.; Pardalos, Panos M. - In: Computational optimization and applications : an … 43 (2009) 3, pp. 449-463
Persistent link: https://www.econbiz.de/10003877504
Cover Image
Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
Leite Rocha, Pedro; Ravetti, Martín Gómez; Mateus, … - In: Computers & operations research : and their … 35 (2008) 4, pp. 1250-1264
Persistent link: https://www.econbiz.de/10003670200
Cover Image
A new exact maximum clique algorithm for large and massive sparse graphs
San Segundo, Pablo; Lopez, Alvaro; Pardalos, Panos M. - In: Computers & operations research : and their … 66 (2016), pp. 81-94
Persistent link: https://www.econbiz.de/10011428989
Cover Image
A branch-and-price algorithm for production routing problems with carbon cap-and-trade
Qiu, Yuzhuo; Qiao, Jun; Pardalos, Panos M. - In: Omega : the international journal of management science 68 (2017), pp. 49-61
Persistent link: https://www.econbiz.de/10011686757
Cover Image
A hybrid VNS-HS algorithm for a suppy chain scheduling problem with deteriorating jobs
Liu, Xinbao; Lu, Shaojun; Pei, Jun; Pardalos, Panos M. - In: International journal of production research 56 (2018) 17, pp. 5758-5775
Persistent link: https://www.econbiz.de/10011946187
Cover Image
CliSAT : a new exact algorithm for hard maximum clique problems
San Segundo, Pablo; Furini, Fabio; Álvarez, David; … - In: European journal of operational research : EJOR 307 (2023) 3, pp. 1008-1025
Persistent link: https://www.econbiz.de/10014282934