Narrow search
Showing 1 - 10 of 31
Cover Image
Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
Morrison, David Robert; Sewell, Edward C.; Jacobson, … - In: INFORMS journal on computing : JOC 28 (2016) 1, pp. 67-82
Persistent link: https://www.econbiz.de/10011453779
Cover Image
Two-dimensional phase unwrapping via balanced spanning forests
Herszterg, Ian; Poggi, Marcus; Vidal, Thibaut - In: INFORMS journal on computing : JOC 31 (2019) 3, pp. 527-543
Persistent link: https://www.econbiz.de/10012061804
Cover Image
Learning to rank in entity relationship graphs
Raschid, Louiqa; Sayyadi, Hassan; Hristidis, Vagelis - In: INFORMS journal on computing : JOC 31 (2019) 4, pp. 671-688
Persistent link: https://www.econbiz.de/10012125726
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-price algorithm for solving the Hamiltonian p-median problem
Marzouk, Ahmed M.; Moreno-Centeno, Erick; Üster, Halit - In: INFORMS journal on computing : JOC 28 (2016) 4, pp. 674-684
Persistent link: https://www.econbiz.de/10011617548
Cover Image
Solving the maximum clique and vertex coloring problems on very large sparse networks
Verma, Anurag; Buchanan, Austin; Butenko, Sergiy - In: INFORMS journal on computing : JOC 27 (2015) 1, pp. 164-177
Persistent link: https://www.econbiz.de/10010505031
Cover Image
New heuristic approaches for the bounded-diameter minimum spanning tree problem
Steitz, Wolfgang - In: INFORMS journal on computing : JOC 27 (2015) 1, pp. 151-163
Persistent link: https://www.econbiz.de/10010505037
Cover Image
On bounding the bandwidth of graphs with symmetry
Dam, Edwin Robert van; Sotirov, R. - In: INFORMS journal on computing : JOC 27 (2015) 1, pp. 75-88
Persistent link: https://www.econbiz.de/10010505085
Cover Image
Model counting of monotone conjunctive normal form formulas with spectra
Vaisman, Radislav; Strichman, Ofer; Gercbach, Ilʹja B. - In: INFORMS journal on computing : JOC 27 (2015) 2, pp. 406-415
Persistent link: https://www.econbiz.de/10011291287
Cover Image
Dynamic programming driven memetic search for the Steiner tree problem with revenues, budget, and hop constraints
Fu, Zhang-Hua; Hao, Jin-Kao - In: INFORMS journal on computing : JOC 27 (2015) 2, pp. 221-237
Persistent link: https://www.econbiz.de/10011291334