Narrow search
Showing 1 - 10 of 11
Cover Image
An integer-programming-based approach to the close-enough traveling salesman problem
Behdani, Behnam; Smith, J. Cole - In: INFORMS journal on computing : JOC 26 (2014) 3, pp. 415-432
Persistent link: https://www.econbiz.de/10010399822
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
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
Exact facetial odd-cycle separation for maximum cut and binary quadratic optimization
Jünger, Michael; Mallach, Sven - In: INFORMS journal on computing : JOC 33 (2021) 4, pp. 1419-1430
Persistent link: https://www.econbiz.de/10012796926
Cover Image
Sparse solutions by a quadratically constrained q (0 < q < 1) minimization model
Jiang, Shan; Fang, Shu-Cherng; Jin, Qingwei - In: INFORMS journal on computing : JOC 33 (2021) 2, pp. 511-530
Persistent link: https://www.econbiz.de/10012546104
Cover Image
Using a Conic Bundle method to accelerate both phases of a quadratic convex reformulation
Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie; … - In: INFORMS journal on computing : JOC 29 (2017) 2, pp. 318-331
Persistent link: https://www.econbiz.de/10011691204
Cover Image
Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method
Huang, Kuo-Ling; Mehrotra, Sanjay - In: INFORMS journal on computing : JOC 29 (2017) 1, pp. 36-53
Persistent link: https://www.econbiz.de/10011648509
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
Quadratic combinatorial optimization using separable underestimators
Buchheim, Christoph; Traversi, Emiliano - In: INFORMS journal on computing : JOC 30 (2018) 3, pp. 424-437
Persistent link: https://www.econbiz.de/10011948053
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