首页    期刊浏览 2024年12月03日 星期二
登录注册

文章基本信息

  • 标题:Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
  • 其他标题:Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
  • 作者:de Farias Jr, I. R. ; Kozyreff, E. ; Gupta, R.
  • 期刊名称:Mathematical Programming Computation
  • 印刷版ISSN:1867-2957
  • 出版年度:2013
  • 页码:75-112
  • DOI:10.1007/mpc.v0i0.103
  • 语种:English
  • 出版社:Mathematical Programming Computation
  • 摘要:We report and analyze the results of our computational testing of branchand-cut for piecewise linear optimization using the cutting planes given recently by Zhao and de Farias. Besides evaluating the performance of the cuts, we evaluate the effect of formulation on the performance of branch-and-cut. Finally, we report and analyze results on piecewise linear optimization problems with semi-continuous constraints.
  • 关键词:90
Loading...
联系我们|关于我们|网站声明
国家哲学社会科学文献中心版权所有