{"title":"用分支割法求解具有互补约束的线性规划","authors":"Bin Yu, J. Mitchell, J. Pang","doi":"10.1007/s12532-018-0149-2","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":47044,"journal":{"name":"Mathematical Programming Computation","volume":null,"pages":null},"PeriodicalIF":4.3000,"publicationDate":"2018-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Solving linear programs with complementarity constraints using branch-and-cut\",\"authors\":\"Bin Yu, J. Mitchell, J. Pang\",\"doi\":\"10.1007/s12532-018-0149-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":47044,\"journal\":{\"name\":\"Mathematical Programming Computation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.3000,\"publicationDate\":\"2018-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Programming Computation\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s12532-018-0149-2\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Programming Computation","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s12532-018-0149-2","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
期刊介绍：
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
