.png){kind=icon}
Return
Augmentation search for integer programming over a polyhedron
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2025.107204.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Graver bases
Integer programming
Augmentation
Nonlinear integer programming
Quadratic assignment
Clustering
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveA Quantum-Inspired Bilevel Optimization Algorithm for the First Responder Network Design Problem
OAAI
OAAIShareSaveShareSave
View more