### Table I. Basic terms and notation for linear (LP), semidefinite (SDP), and conic programming. Term LP SDP Conic Notation

2005

Cited by 11

### Table 3: Bounds from Semidefinite Programming. (Intel Pentium III, 933 MHz). 30

2004

### Table 3: Bounds from Semidefinite Programming. (Intel Pentium III, 933 MHz). 30

2004

### TABLE I Linear programming formulation for optimal routing.

2004

Cited by 3

### Table 3: Bounds and formulations.

1996

"... In PAGE 24: ... While we have focused there on the physical meaning of these relations, we show in this section how they can be used to provide performance bounds for MQNETs by solving appropriate mathematical programming problems. We shall consider in what follows a linear cost function c#28x#29= X j2N c j x j ; and denote by Z the minimum cost achievable under the appropriate class of policies #28dynamic stable or static, nonidling and stable#29 policies, Z = min 8 #3C : X j2N c j x j j x 2X 9 = ; : Wehave summarized in Table3 several lower bounds and their corresponding mathematical pro- gramming formulations, obtained by selecting appropriate subsets of the constraints developed in previous sections.... ..."

### TABLE 1. LP relaxations of QAP integer programming formulation

1998

Cited by 13