2011 Modeling disjunctive constraints with a logarithmic number of binary variables and constraints教材.pdfVIP

  • 14
  • 0
  • 约8.38万字
  • 约 24页
  • 2015-10-21 发布于江西
  • 举报

2011 Modeling disjunctive constraints with a logarithmic number of binary variables and constraints教材.pdf

Math. Program., Ser. A (2011) 128:49–72 DOI 10.1007/s10107-009-0295-4 FULL LENGTH PAPER Modeling disjunctive constraints with a logarithmic number of binary variables and constraints Juan Pablo Vielma · George L. Nemhauser Received: 29 July 2008 / Accepted: 15 May 2009 / Published online: 2 July 2009 © Springer and Mathematical Programming Society 2009 Abstract Many combinatorial constraints over continuous variables such as SOS1 and SOS2 constraints can be interpreted as disjunctive constraints that restrict the variables to lie in the union of a finite numb

文档评论(0)

1亿VIP精品文档

相关文档