Small travelling salesman polytopes SC Boyd, WH Cunningham Mathematics of Operations Research 16 (2), 259-271, 1991 | 87 | 1991 |
Optimizing over the subtour polytope of the travelling salesman problem SC Boyd, WR Pulleyblank Mathematical programming 49, 163-187, 1990 | 64 | 1990 |
The synchronization problem in protocol testing and its complexity S Boyd, H Ural Information Processing Letters 40 (3), 131-136, 1991 | 62 | 1991 |
TSP on cubic and subcubic graphs S Boyd, R Sitters, S van der Ster, L Stougie Integer Programming and Combinatoral Optimization: 15th International …, 2011 | 57 | 2011 |
CVX: Matlab software for disciplined convex programming, June 2009 M Grant, S Boyd Article (CrossRef Link), 0 | 55 | |
CVX package M Grant, S Boyd Accessed: Feb, 2012 | 51 | 2012 |
CVX: Matlab software for disciplined convex programming, version 2.0 beta, Sep. 2012 M Grant, S Boyd Available on-line at http://cvxr. com/cvx, 2008 | 50 | 2008 |
The traveling salesman problem on cubic and subcubic graphs S Boyd, R Sitters, S van der Ster, L Stougie Mathematical Programming 144 (1), 227-245, 2014 | 44 | 2014 |
Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices S Boyd, R Carr Discrete Optimization 8 (4), 525-539, 2011 | 42* | 2011 |
CVX: Matlab Software for Disciplined Convex Programming; CVX Research M Grant, S Boyd, Y Ye Inc.: Austin, TX, USA, 2008 | 40 | 2008 |
An integer polytope related to the design of survivable communication networks SC Boyd, T Hao SIAM Journal on Discrete Mathematics 6 (4), 612-630, 1993 | 40 | 1993 |
Finding the exact integrality gap for small traveling salesman problems G Benoit, S Boyd Mathematics of Operations Research 33 (4), 921-931, 2008 | 37 | 2008 |
Finding 2-factors closer to TSP tours in cubic graphs S Boyd, S Iwata, K Takazawa SIAM Journal on Discrete Mathematics 27 (2), 918-939, 2013 | 34 | 2013 |
CVX: Matlab software for disciplined convex programming, version 1.21 (2010) M Grant, S Boyd 金小萍 (1978−), 女, 中国计量大学信息工程学院副教授, 硕士生导师, 主要研究方向 …, 2010 | 34 | 2010 |
On the complexity of generating optimal test sequences SC Boyd, H Ural IEEE Transactions on Software Engineering 17 (9), 976, 1991 | 32 | 1991 |
On the integrality gap of the 2-edge connected subgraph problem A Alexander, S Boyd, P Elliott-Magwood Technical Report TR-2006-04, SITE, University of Ottawa, Ottawa, Canada, 2006 | 31 | 2006 |
CVX: Matlab software for disciplined convex programming. ver. 1.21, Apr. 2011 M Grant, S Boyd Build, 0 | 31 | |
CVX: Matlab software for disciplined convex programming.{Online} M Grant, S Boyd, Y Ye Apr, 2010 | 29 | 2010 |
CVX: Matlab software for disciplined convex programming. Dec. 2008 M Grant, S Boyd URL: http://cvxr. com/cvx, 0 | 29 | |
Facet generating techniques S Boyd, WR Pulleyblank Research Trends in Combinatorial Optimization: Bonn 2008, 33-55, 2009 | 28 | 2009 |