400 search results - page 63 / 80 » Extended formulations in combinatorial optimization |
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
DCC
2002
IEEE
14 years 6 months ago
2002
IEEE
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...
ASPDAC
2009
ACM
14 years 1 months ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
CODES
2005
IEEE
14 years 11 days ago
2005
IEEE
Instruction-set extensible processors allow an existing processor core to be extended with application-specific custom instructions. In this paper, we explore a novel application...
HM
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...