Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations

IF 4.3 1区 数学 Q1 COMPUTER SCIENCE, SOFTWARE ENGINEERING Mathematical Programming Computation Pub Date : 2022-11-07 DOI:10.1007/s12532-022-00228-y
Demetrios V. Papazaharias, J. Walteros
{"title":"Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations","authors":"Demetrios V. Papazaharias, J. Walteros","doi":"10.1007/s12532-022-00228-y","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":4.3000,"publicationDate":"2022-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Programming Computation","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s12532-022-00228-y","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
解决稀疏图上的图划分:切割,投影和扩展公式
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Mathematical Programming Computation
Mathematical Programming Computation OPERATIONS RESEARCH & MANAGEMENT SCIENCE-
CiteScore
10.80
自引率
4.80%
发文量
18
期刊介绍: 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.
期刊最新文献
Effective matrix adaptation strategy for noisy derivative-free optimization KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price CP-Lib: Benchmark Instances of the Clique Partitioning Problem Self-adaptive ADMM for semi-strongly convex problems Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1