Sciweavers

105 search results - page 5 / 21

» On Semidefinite Programming Relaxations of the Traveling Sal...

19

JCO
1998

80views more JCO 1998»

Semidefinite Programming Relaxations for the Quadratic Assignment Problem

13 years 6 months ago

Semidefinite Programming Relaxations for the Quadratic Assignment Problem

Download www.diku.dk

Qing Zhao, Stefan E. Karisch, Franz Rendl, Henry W...

claim paper

Read More »

18

MP
2007

73views more MP 2007»

Semidefinite programming relaxations for graph coloring and maximal clique problems

13 years 6 months ago

Semidefinite programming relaxations for graph coloring and maximal clique problems

Download www.core.ucl.ac.be

Igor Dukanovic, Franz Rendl

claim paper

Read More »

20

MP
2007

81views more MP 2007»

On approximating complex quadratic optimization problems via semidefinite programming relaxations

13 years 6 months ago

On approximating complex quadratic optimization problems via semidefinite programming relaxations

Download www.stanford.edu

Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye

claim paper

Read More »

19

JGO
2010

96views more JGO 2010»

Solving polynomial least squares problems via semidefinite programming relaxations

13 years 1 months ago

Solving polynomial least squares problems via semidefinite programming relaxations

Download www.is.titech.ac.jp

Sunyoung Kim, Masakazu Kojima

claim paper

Read More »

22

CSJM
2006

59views more CSJM 2006»

Traveling Salesman Problem with Transportation

13 years 7 months ago

Traveling Salesman Problem with Transportation

Download www.math.md

Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...

Valeriu Ungureanu

claim paper

Read More »

« Prev « First page 5 / 21 Last » Next »