解决困难的混合整数线性规划的实用指南

Surveys in Operations Research and Management Science Pub Date : 2013-10-01 DOI:10.1016/j.sorms.2012.12.001

Ed Klotz , Alexandra M. Newman

{"title":"解决困难的混合整数线性规划的实用指南","authors":"Ed Klotz , Alexandra M. Newman","doi":"10.1016/j.sorms.2012.12.001","DOIUrl":null,"url":null,"abstract":"<div><p>Even with state-of-the-art hardware and software, mixed integer programs can require hours, or even days, of run time and are not guaranteed to yield an optimal (or near-optimal, or any!) solution. In this paper, we present suggestions for appropriate use of state-of-the-art optimizers and guidelines for careful formulation, both of which can vastly improve performance.</p></div>","PeriodicalId":101192,"journal":{"name":"Surveys in Operations Research and Management Science","volume":"18 1","pages":"Pages 18-32"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.sorms.2012.12.001","citationCount":"137","resultStr":"{\"title\":\"Practical guidelines for solving difficult mixed integer linear programs\",\"authors\":\"Ed Klotz , Alexandra M. Newman\",\"doi\":\"10.1016/j.sorms.2012.12.001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Even with state-of-the-art hardware and software, mixed integer programs can require hours, or even days, of run time and are not guaranteed to yield an optimal (or near-optimal, or any!) solution. In this paper, we present suggestions for appropriate use of state-of-the-art optimizers and guidelines for careful formulation, both of which can vastly improve performance.</p></div>\",\"PeriodicalId\":101192,\"journal\":{\"name\":\"Surveys in Operations Research and Management Science\",\"volume\":\"18 1\",\"pages\":\"Pages 18-32\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.sorms.2012.12.001\",\"citationCount\":\"137\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Surveys in Operations Research and Management Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1876735413000020\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Surveys in Operations Research and Management Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1876735413000020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 137

摘要

即使使用最先进的硬件和软件，混合整数程序也可能需要数小时甚至数天的运行时间，并且不能保证产生最优(或接近最优，或任何!)的解决方案。在本文中，我们提出了适当使用最先进的优化器的建议和仔细制定的指导方针，这两者都可以极大地提高性能。

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

查看原文本刊更多论文

Practical guidelines for solving difficult mixed integer linear programs

Even with state-of-the-art hardware and software, mixed integer programs can require hours, or even days, of run time and are not guaranteed to yield an optimal (or near-optimal, or any!) solution. In this paper, we present suggestions for appropriate use of state-of-the-art optimizers and guidelines for careful formulation, both of which can vastly improve performance.

求助全文

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

来源期刊

Surveys in Operations Research and Management Science

自引率

0.00%

发文量