连通max-k-cut问题的混合整数规划技术

IF 4.3 1区数学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Mathematical Programming Computation Pub Date : 2020-04-30 DOI:10.1007/s12532-020-00186-3

Christopher Hojny, Imke Joormann, Hendrik Lüthen, Martin Schmidt

引用次数: 16

摘要

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Mixed-integer programming techniques for the connected max-k-cut problem

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Mathematical Programming Computation OPERATIONS RESEARCH & MANAGEMENT SCIENCE-

CiteScore

10.80

自引率

4.80%

发文量

期刊介绍： Mathematical Programming Computation (MPC) publishes original research articles advancing the state of the art of practical computation in Mathematical Optimization and closely related fields. Authors are required to submit software source code and data along with their manuscripts (while open-source software is encouraged, it is not required). Where applicable, the review process will aim for verification of reported computational results. Topics of articles include: New algorithmic techniques, with substantial computational testing New applications, with substantial computational testing Innovative software Comparative tests of algorithms Modeling environments Libraries of problem instances Software frameworks or libraries. Among the specific topics covered in MPC are linear programming, convex optimization, nonlinear optimization, stochastic optimization, integer programming, combinatorial optimization, global optimization, network algorithms, and modeling languages. MPC accepts manuscript submission from its own editorial board members in cases in which the identities of the associate editor, reviewers, and technical editor handling the manuscript can remain fully confidential. To be accepted, manuscripts submitted by editorial board members must meet the same quality standards as all other accepted submissions; there is absolutely no special preference or consideration given to such submissions.