Narrow search
Showing 1 - 10 of 41
Cover Image
A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
Klerk, Etienne de; Sotirov, R.; Truetsch, U. - In: INFORMS journal on computing : JOC 27 (2015) 2, pp. 378-391
Persistent link: https://www.econbiz.de/10011291292
Cover Image
The robust (minmax regret) quadratic assignment problem with interval flows
Feizollahi, Mohammad Javad; Averbakh, Igor - In: INFORMS journal on computing : JOC 26 (2014) 2, pp. 321-335
Persistent link: https://www.econbiz.de/10010362439
Cover Image
A graphics processing unit algorithm to solve the quadratic assignment problem using level-2 reformulation-linearization technique
Gonçalves, Alexandre Domingues; Pessoa, Artur; Bentes, … - In: INFORMS journal on computing : JOC 29 (2017) 4, pp. 676-687
Persistent link: https://www.econbiz.de/10011772456
Cover Image
Level 2 reformulation linearization technique-based parallel algorithms for solving large quadratic assignment problems on graphics processing unit clusters
Date, Ketan; Nagi, Rakesh - In: INFORMS journal on computing : JOC 31 (2019) 4, pp. 771-789
Persistent link: https://www.econbiz.de/10012125744
Cover Image
Backdoor branching
Fischetti, Matteo; Monaci, Michele - In: INFORMS journal on computing : JOC 25 (2013) 4, pp. 693-700
Persistent link: https://www.econbiz.de/10010203613
Cover Image
Lateness minimization in pairwise connectivity restoration problems
Averbakh, Igor; Pereira, Jordi - In: INFORMS journal on computing : JOC 30 (2018) 3, pp. 522-538
Persistent link: https://www.econbiz.de/10011948069
Cover Image
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea; Cacchiani, Valentina; Malaguti, Enrico - In: INFORMS journal on computing : JOC 29 (2017) 3, pp. 457-473
Persistent link: https://www.econbiz.de/10011743447
Cover Image
A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization
Cordone, Roberto; Hosteins, Pierre; Righini, Giovanni - In: INFORMS journal on computing : JOC 30 (2018) 1, pp. 168-180
Persistent link: https://www.econbiz.de/10011848225
Cover Image
Planar maximum coverage location problem with partial coverage and rectangular demand and service zones
Bansal, Manish; Kianfar, Kiavash - In: INFORMS journal on computing : JOC 29 (2017) 1, pp. 152-169
Persistent link: https://www.econbiz.de/10011648546
Cover Image
A machine learning-based approximation of strong branching
Marcos Alvarez, Alejandro; Louveaux, Quentin; Wehenkel, … - In: INFORMS journal on computing : JOC 29 (2017) 1, pp. 185-195
Persistent link: https://www.econbiz.de/10011648592