Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization - Fields Institute Monographs
Latest Publications

TOTAL DOCUMENTS

12

(FIVE YEARS 0)

H-INDEX

0

(FIVE YEARS 0)

Published By American Mathematical Society

9781470428112, 9781470417901

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Lift-and-project ranks for combinatorial optimzation

Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization - Fields Institute Monographs ◽

10.1090/fim/027/08 ◽

2010 ◽

pp. 143-163

Download Full-text

Approximation algorithms based on SDP

Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization - Fields Institute Monographs ◽

10.1090/fim/027/05 ◽

2010 ◽

pp. 83-104

Keyword(s):

Approximation Algorithms

Download Full-text

Ellipsoid method

Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization - Fields Institute Monographs ◽

10.1090/fim/027/03 ◽

2010 ◽

pp. 53-61

Keyword(s):

Ellipsoid Method

Download Full-text

An application to discrepancy theory

Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization - Fields Institute Monographs ◽

10.1090/fim/027/11 ◽

2010 ◽

pp. 183-188

Keyword(s):

Discrepancy Theory

Download Full-text

Lift-and-project procedures for combinatorial optimization problems

Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization - Fields Institute Monographs ◽

10.1090/fim/027/07 ◽

2010 ◽

pp. 129-141

Keyword(s):

Combinatorial Optimization ◽

Optimization Problems ◽

Combinatorial Optimization Problems

Download Full-text

Successive convex relaxation methods

Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization - Fields Institute Monographs ◽

10.1090/fim/027/09 ◽

2010 ◽

pp. 165-175

Keyword(s):

Convex Relaxation ◽

Relaxation Methods

Download Full-text

Introduction

Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization - Fields Institute Monographs ◽

10.1090/fim/027/01 ◽

2010 ◽

pp. 1-26

Download Full-text

Primal-dual interior-point methods

Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization - Fields Institute Monographs ◽

10.1090/fim/027/04 ◽

2010 ◽

pp. 63-81

Keyword(s):

Interior Point ◽

Interior Point Methods ◽

Download Full-text

SDP representability

Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization - Fields Institute Monographs ◽

10.1090/fim/027/12 ◽

2010 ◽

pp. 189-202

Download Full-text

Connections to other areas of mathematics

Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization - Fields Institute Monographs ◽

10.1090/fim/027/10 ◽

2010 ◽

pp. 177-181

Download Full-text