- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j24 |      | Sabrina Bernardi, Miguel F. Anjos: A two-stage mathematical-programming method for the multi-floor facility layout problem. JORS 64(3): 352-364 (2013) |
| 2012 | ||
| j23 | | 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) |
| j22 | | Giuseppe Tommaso Costanzo, Guchuan Zhu, Miguel F. Anjos, Gilles Savard: A System Architecture for Autonomous Demand Side Load Management in Smart Buildings. IEEE Trans. Smart Grid 3(4): 2157-2165 (2012) |
| c7 | | |
| 2011 | ||
| j21 | | 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) |
| j20 | | 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) |
| j19 | | |
| j18 | | 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) |
| c6 | | Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos: An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming. IPCO 2011: 207-222 |
| 2010 | ||
| j17 | | 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) |
| j16 | | 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) |
| c5 | | James Ostrowski, Miguel F. Anjos, Anthony Vannelli: Tight mixed integer linear programming formulations for generator Self-Scheduling. CCECE 2010: 1-4 |
| 2008 | ||
| j15 | | 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) |
| j14 | | Chaomin Luo, Miguel F. Anjos, Anthony Vannelli: A nonlinear optimization methodology for VLSI fixed-outline floorplanning. J. Comb. Optim. 16(4): 378-401 (2008) |
| j13 | | |
| c4 | | Chaomin Luo, Miguel F. Anjos, Anthony Vannelli: Large-scale fixed-outline floorplanning design using convex optimization techniques. ASP-DAC 2008: 198-203 |
| 2007 | ||
| j12 | | 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 | ||
| j11 | | 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) |
| j10 | | Miguel F. Anjos, Anthony Vannelli: A New Mathematical-Programming Framework for Facility-Layout Design. INFORMS Journal on Computing 18(1): 111-118 (2006) |
| j9 | | Miguel F. Anjos: Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems. JSAT 1(1): 1-47 (2006) |
| c3 | | 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 |
| 2005 | ||
| j8 | | 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) |
| j7 | | 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) |
| j6 | | Miguel F. Anjos: An improved semidefinite programming relaxation for the satisfiability problem. Math. Program. 102(3): 589-608 (2005) |
| c2 | | P. L. Takouda, Miguel F. Anjos, Anthony Vannelli: Global Lower Bounds for the VLSI Macrocell Floorplanning Problem Using Semidefinite Optimization. IWSOC 2005: 275-280 |
| c1 | | Miguel F. Anjos, Anthony Vannelli: On the Computational Performance of a Semidefinite Programming Approach to Single Row Layout Problems. OR 2005: 277-282 |
| 2004 | ||
| j5 | | Miguel F. Anjos: On semidefinite programming relaxations for the satisfiability problem. Math. Meth. of OR 60(3): 349-367 (2004) |
| 2002 | ||
| j4 | | 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) |
| j3 | | Henry Wolkowicz, Miguel F. Anjos: Semidefinite programming for discrete optimization and matrix completion problems. Discrete Applied Mathematics 123(1-3): 513-577 (2002) |
| j2 | | Miguel F. Anjos, Henry Wolkowicz: Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks. J. Comb. Optim. 6(3): 237-270 (2002) |
| j1 | | Miguel F. Anjos, Anthony Vannelli: An Attractor-Repeller approach to floorplanning. Math. Meth. of OR 56(1): 3-27 (2002) |
Colors in the list of coauthors
Last update Sun May 19 01:07:55 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page