{"title":"多面体上整数规划的增广搜索","authors":"Tolga Bektaş","doi":"10.1016/j.cor.2025.107204","DOIUrl":null,"url":null,"abstract":"<div><div>This paper describes a primal search algorithm to optimise an integer programme defined over a polyhedron. The search is conducted on the lattice described by the linear constraints of the model, where search directions are derived in the spirit of Graver bases and extracted dynamically using a feasibility-seeking black-box. Computational results show potential particularly on 0-1 programming formulations with complex objective functions when compared with state-of-the-art solvers.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"183 ","pages":"Article 107204"},"PeriodicalIF":4.3000,"publicationDate":"2025-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Augmentation search for integer programming over a polyhedron\",\"authors\":\"Tolga Bektaş\",\"doi\":\"10.1016/j.cor.2025.107204\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This paper describes a primal search algorithm to optimise an integer programme defined over a polyhedron. The search is conducted on the lattice described by the linear constraints of the model, where search directions are derived in the spirit of Graver bases and extracted dynamically using a feasibility-seeking black-box. Computational results show potential particularly on 0-1 programming formulations with complex objective functions when compared with state-of-the-art solvers.</div></div>\",\"PeriodicalId\":10542,\"journal\":{\"name\":\"Computers & Operations Research\",\"volume\":\"183 \",\"pages\":\"Article 107204\"},\"PeriodicalIF\":4.3000,\"publicationDate\":\"2025-07-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Operations Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0305054825002321\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825002321","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
Augmentation search for integer programming over a polyhedron
This paper describes a primal search algorithm to optimise an integer programme defined over a polyhedron. The search is conducted on the lattice described by the linear constraints of the model, where search directions are derived in the spirit of Graver bases and extracted dynamically using a feasibility-seeking black-box. Computational results show potential particularly on 0-1 programming formulations with complex objective functions when compared with state-of-the-art solvers.
期刊介绍:
Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.