G. Iyengar, M. T. Çezik  Home/Search
Context
Related
| columbia.edu/reports...tr200102.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: columbia.edu/report...techreports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Introduction The goal of this research is to develop cut generation methods for mixed 0-1 second-order cone programs (SOCPs) having the following form, subject to kA i x + b i k c i x + d i ; i = 1; : : : ; N; (1) where x 2 R is the optimization variable, and the problem parameters are f 2 R , A i 2 R (n i 1)n , b i 2 R n i 1 , c i 2 R and d i 2 R. The norm appearing in the constraints is the standard Euclidean norm, i.e. kuk = p u u. Second-order cone programming is... (Update)
Similar documents (at the sentence level):
72.5%: Cut Generation for Mixed 0-1 Quadratically Constrained Programs - Iyengar, Cezik (2001) (Correct)
Active bibliography (related documents): More All
0.5: Nonconvex All-Quadratic Global Optimization Problems: Solution.. - Raber (1999) (Correct)
0.4: Lift-and-Project Cutting Planes for Mixed 0-1 Semidefinite .. - Iyengar, Çezik (2001) (Correct)
0.1: Heuristics for Cardinality Constrained Portfolio.. - Chang, Meade, Beasley.. (1998) (Correct)
Similar documents based on text: More All
0.2: Robust Convex Quadratically Constrained Programs - Goldfarb, Iyengar (2002) (Correct)
0.1: Disjunctive Cut Generation for Mixed 0-1 Programs: Duality and .. - Ceria, Soares (1997) (Correct)
0.1: Semidefinite Relaxations For The Traveling Salesman Problem - Cezik, Iyengar (2001) (Correct)
BibTeX entry: (Update)
@misc{ iyengar-cut,
author = "G. Iyengar and M. T. Çezik",
title = "Cut Generation for Mixed 0-1 Quadratically Constrained Programs",
url = "citeseer.ist.psu.edu/iyengar01cut.html" }
Citations (may not include all citations):326 Interior-point polynomial algorithms in convex programming (context) - Nesterov, Nemirovskii - 1993
117 A lift-and-project cutting plane algorithm for mixed 0-1 pro.. (context) - Balas, Ceria et al. - 1993
72 Cones of matrices and set-functions and 0-1 optimization (context) - Lov, Schrijver - 1991
69 Determinant maximization with linear matrix inequality const.. - Vandenberghe, Boyd et al. - 1998
67 Applications of second-order cone programming (context) - Lobo, Vandenberghe et al. - 1998
31 Cones of matrices and successive convex relaxations of nonco.. - Kojima, Tun - 2000
24 Disjunctive programming (context) - Balas - 1979
11 Computational study of a family of mixed integer quadratic p.. - Bienstock - 1996
9 A branch-and-cut method for 0-1 mixed convex programming (context) - Stubbs, Mehrotra - 1999
8 Second order cone programming relaxations of nonconvex quadr.. - Kim, Kojima - 2000
4 Semide nite methods for the traveling salesman and other com.. (context) - ezik - 2000
2 A heirarchy of relaxations and convex hull representations f.. (context) - Sherali, Adams - 1989
2 Generating convex quadratic inequalities for mixed 0-1 progr.. (context) - Stubbs, Mehrotra - 1999
2 A hierarchy of semide nite relaxations & convex nonlinear va.. (context) - Stubbs, Mehrotra - 1997
2 Quadratically constrained quadratic programming: some applic.. (context) - Hao - 1982
2 Cutting plane methods for mixed 0-1 semide nite programs (context) - Iyengar, ezik - 2000
Documents on the same site (http://www.corc.ieor.columbia.edu/reports/techreports.html): More
Experiments With a Network Design Algorithm Using.. - Bienstock (1998) (Correct)
Many-to-one Stable Matching: Geometry and Fairness - Sethuraman, Teo, Qian (2004) (Correct)
Concurrent Flows in O*(1/ε) iterations - Bienstock, Iyengar (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC