Scholarlink

<p>In this paper, we study the branch-and-cut method for multiband robust optimization problems. We assume that cardinality parameters are not restricted to be integers. We propose two types of valid inequalities for the multiband robust knapsack problem using submodularity, polymatroid inequalities and polymatroid cover inequalities. The computational results conducted on the (multidimensional) multiband robust knapsack problems demonstrate the effectiveness of the proposed valid inequalities.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Branch-and-cut algorithm for multiband robust discrete optimization problems

  • 期刊论文

  • 发表日期：

    2025年12月10日

查看全文
  • Seulgi Joung

摘要

In this paper, we study the branch-and-cut method for multiband robust optimization problems. We assume that cardinality parameters are not restricted to be integers. We propose two types of valid inequalities for the multiband robust knapsack problem using submodularity, polymatroid inequalities and polymatroid cover inequalities. The computational results conducted on the (multidimensional) multiband robust knapsack problems demonstrate the effectiveness of the proposed valid inequalities.