 | 2012 |
| 26 |  | Alexander Engau,
Miguel F. Anjos,
Anthony Vannelli:
On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems.
Optimization Methods and Software 27(3): 539-559 (2012) |
| 2011 |
| 25 |  | Bissan Ghaddar,
Juan C. Vera,
Miguel F. Anjos:
An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming.
IPCO 2011: 207-222 |
| 24 |  | Bissan Ghaddar,
Miguel F. Anjos,
Frauke Liers:
A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem.
Annals OR 188(1): 155-174 (2011) |
| 23 |  | Ibolya Jankovits,
Chaomin Luo,
Miguel F. Anjos,
Anthony Vannelli:
A convex optimisation framework for the unequal-areas facility layout problem.
European Journal of Operational Research 214(2): 199-215 (2011) |
| 22 |  | Miguel F. Anjos,
Etienne de Klerk,
Franz Rendl:
Preface.
Math. Program. 129(1): 1-3 (2011) |
| 21 |  | Bissan Ghaddar,
Juan C. Vera,
Miguel F. Anjos:
Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs.
SIAM Journal on Optimization 21(1): 391-414 (2011) |
| 2010 |
| 20 |  | James Ostrowski,
Miguel F. Anjos,
Anthony Vannelli:
Tight mixed integer linear programming formulations for generator Self-Scheduling.
CCECE 2010: 1-4 |
| 19 |  | Alexander Engau,
Miguel F. Anjos,
Anthony Vannelli:
An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization.
Electronic Notes in Discrete Mathematics 36: 743-750 (2010) |
| 18 |  | Alexander Engau,
Miguel F. Anjos,
Anthony Vannelli:
On Interior-Point Warmstarts for Linear and Combinatorial Optimization.
SIAM Journal on Optimization 20(4): 1828-1861 (2010) |
| 2008 |
| 17 |  | Chaomin Luo,
Miguel F. Anjos,
Anthony Vannelli:
Large-scale fixed-outline floorplanning design using convex optimization techniques.
ASP-DAC 2008: 198-203 |
| 16 |  | Miguel F. Anjos,
Anthony Vannelli:
Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes.
INFORMS Journal on Computing 20(4): 611-617 (2008) |
| 15 |  | Chaomin Luo,
Miguel F. Anjos,
Anthony Vannelli:
A nonlinear optimization methodology for VLSI fixed-outline floorplanning.
J. Comb. Optim. 16(4): 378-401 (2008) |
| 14 |  | Miguel F. Anjos:
An Extended Semidefinite Relaxation for Satisfiability.
JSAT 4(1): 15-31 (2008) |
| 2007 |
| 13 |  | Miguel F. Anjos,
Samuel Burer:
On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization.
SIAM Journal on Optimization 18(4): 1310-1325 (2007) |
| 2006 |
| 12 |  | Miguel F. Anjos,
Michael Desroches,
Anwar Haque,
Oleg Grodzevich,
Hua Wei,
Henry Wolkowicz:
Multi-Stage Investment Decision under Contingent Demand for Networking Planning.
GLOBECOM 2006 |
| 11 |  | Miguel F. Anjos:
An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs.
Ann. Math. Artif. Intell. 48(1-2): 1-14 (2006) |
| 10 |  | Miguel F. Anjos,
Anthony Vannelli:
A New Mathematical-Programming Framework for Facility-Layout Design.
INFORMS Journal on Computing 18(1): 111-118 (2006) |
| 9 |  | Miguel F. Anjos:
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems.
JSAT 1(1): 1-47 (2006) |
| 2005 |
| 8 |  | P. L. Takouda,
Miguel F. Anjos,
Anthony Vannelli:
Global Lower Bounds for the VLSI Macrocell Floorplanning Problem Using Semidefinite Optimization.
IWSOC 2005: 275-280 |
| 7 |  | Miguel F. Anjos,
Anthony Vannelli:
On the Computational Performance of a Semidefinite Programming Approach to Single Row Layout Problems.
OR 2005: 277-282 |
| 6 |  | Miguel F. Anjos,
Andrew A. Kennings,
Anthony Vannelli:
A semidefinite optimization approach for the single-row layout problem with unequal dimensions.
Discrete Optimization 2(2): 113-122 (2005) |
| 5 |  | Miguel F. Anjos,
Russell C. H. Cheng,
Christine S. M. Currie:
Optimal pricing policies for perishable products.
European Journal of Operational Research 166(1): 246-254 (2005) |
| 4 |  | Miguel F. Anjos:
An improved semidefinite programming relaxation for the satisfiability problem.
Math. Program. 102(3): 589-608 (2005) |
| 2002 |
| 3 |  | Miguel F. Anjos,
Henry Wolkowicz:
Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem.
Discrete Applied Mathematics 119(1-2): 79-106 (2002) |
| 2 |  | Henry Wolkowicz,
Miguel F. Anjos:
Semidefinite programming for discrete optimization and matrix completion problems.
Discrete Applied Mathematics 123(1-3): 513-577 (2002) |
| 1 |  | Miguel F. Anjos,
Henry Wolkowicz:
Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks.
J. Comb. Optim. 6(3): 237-270 (2002) |