Augmentation search for integer programming over a polyhedron

Bektaş, T ORCID: 0000-0003-0634-144X (2025) Augmentation search for integer programming over a polyhedron Computers and Operations Research, 183. 107204-. ISSN 0305-0548, 1873-765X

Text Augmentation_Search_Accepted_Manuscript.pdf - Author Accepted Manuscript Available under License Creative Commons Attribution. Download (372kB) | Preview

Abstract

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.

Item Type:	Article
Uncontrolled Keywords:	4901 Applied Mathematics, 4903 Numerical and Computational Mathematics, 49 Mathematical Sciences
Divisions:	Faculty of Humanities & Social Sciences Faculty of Humanities & Social Sciences > School of Management
Depositing User:	Symplectic Admin
Date Deposited:	04 Jul 2025 08:29
Last Modified:	23 May 2026 10:21
DOI:	10.1016/j.cor.2025.107204
Related Websites:	Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3193540
Disclaimer:	The University of Liverpool is not responsible for content contained on other websites from links within repository metadata. Please contact us if you notice anything that appears incorrect or inappropriate.