logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Augmentation search for integer programming over a polyhedron

delete2025-07-22
delete0
PRE
AI
T
Tolga Bektaş
DOI：10.1016/j.cor.2025.107204delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

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
Computers and Operations Research
IF:
4.3
Papers:
6.5K
Citations:
1.8W

Organization

No organization information available