...
首页> 外文期刊>Discrete optimization >Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint
【24h】

Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint

机译:具有耦合基数约束的分布式整数规划问题的分散算法

获取原文
获取原文并翻译 | 示例
           

摘要

We consider a multi-player optimization where each player has her own optimization problem and the individual problems are connected by a cardinality constraint on their shared resources. We give distributed algorithms that allow each player to solve their own optimization problem and still achieve a global optimization solution for problems that possess a concavity property. For problems without the concavity property, we use concave approximating functions to bound the optimality error and provide empirical results on the deviations from optimality. (C) 2020 Elsevier B.V. All rights reserved.
机译:我们考虑多玩家优化,其中每个玩家都有她自己的优化问题,并且个别问题通过其共享资源上的基数约束来连接。我们给出了分布式算法,允许每个参与者解决他们自己的优化问题,并且对于具有凹性的问题仍然实现了全局优化解决方案。对于不具有凹性的问题,我们使用凹逼近函数来限制最优性误差,并提供与最优性偏差的经验结果。(C) 2020爱思唯尔B.V.版权所有。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号