Approximation algorithms for general packing problems and their application to the multicast congestion problem
- 作者Klaus Jansen; Hu Zhang
- 卷第114卷
- 期第1期
- 印刷ISSN0025-5610
- 电子ISSN1436-4646
- 文件大小264.31KB
- 发表时间2008-07
- DOI10.1007/s10107-007-0106-8
- 页码183-206
Block-diagonal semidefinite programming hierarchies for 0/1 programmingNebojša Gvozdenović; Monique Laurent; Frank Vallentin · 2009
The Operator $Psi$ for the Chromatic Number of a GraphGvozdenović, Nebojša; Laurent, Monique · SIAM Journal on Optimization · 2008
Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-DiagonalizationGvozdenović, Nebojša; Laurent, Monique · SIAM Journal on Optimization · 2008
Fully copositive matricesG. S. R. Murthy; T. Parthasarathy · Mathematical Programming · 1998
Election of CouncilMathematical Programming · 1973
Editorial policyMathematical Programming · 1973
The Mathematical Programming SocietyMathematical Programming · 1973
A linear max—min problemJames E. Falk · Mathematical Programming · 1973
Unconstrained optimization based on homogeneous modelsChristakis Charalambous · Mathematical Programming · 1973
Computable error bounds for nonlinear programmingStephen M. Robinson · Mathematical Programming · 1973
Book reviewW. F. Lucas · Mathematical Programming · 1973