Narrow search
Showing 1 - 10 of 400
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
Constrained min-cut replication for K-way hypergraph partitioning
Yazici, Volkan; Aykanat, Cevdet - In: INFORMS journal on computing : JOC 26 (2014) 2, pp. 303-320
Persistent link: https://www.econbiz.de/10010362440
Cover Image
An efficient semidefinite programming relaxation for the graph partition problem
Sotirov, Renata - In: INFORMS journal on computing : JOC 26 (2014) 1, pp. 16-30
Persistent link: https://www.econbiz.de/10010344178
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
Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty
Subramanyam, Anirudh; Repoussis, Panagiotis P.; … - In: INFORMS journal on computing : JOC 32 (2020) 3, pp. 661-681
Persistent link: https://www.econbiz.de/10012294712
Cover Image
Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
Gadegaard, Sune Lauth; Nielsen, Lars Relund; Ehrgott, … - In: INFORMS journal on computing : JOC 31 (2019) 4, pp. 790-804
Persistent link: https://www.econbiz.de/10012125747
Cover Image
A lagrangian bound on the clique number and an exact algorithm for the maximum edge weight clique problem
Hosseinian, Seyedmohammadhossein; Fontes, Dalila B. M. M.; … - In: INFORMS journal on computing : JOC 32 (2020) 3, pp. 747-762
Persistent link: https://www.econbiz.de/10012294726
Cover Image
A multiobjective branch-and-bound framework : application to the biobjective spanning tree problem
Sourd, Francis; Spanjaard, Olivier - In: INFORMS journal on computing : JOC 20 (2008) 3, pp. 472-484
Persistent link: https://www.econbiz.de/10003770222
Cover Image
Convexity and concavity detection in computational graphs : tree walks for convexity assessment
Fourer, Robert; Maheshwari, Chandrakant; Neumaier, Arnold; … - In: INFORMS journal on computing : JOC 22 (2010) 1, pp. 26-43
Persistent link: https://www.econbiz.de/10003962677
Cover Image
Exact solution of graph coloring problems via constraint programming and column generation
Gualandi, Stefano; Malucelli, Federico - In: INFORMS journal on computing : JOC 24 (2012) 1, pp. 81-100
Persistent link: https://www.econbiz.de/10009523288