Faster Integer Programming

A new analysis proves that all integer programs theoretically could be solved much faster than previously guaranteed.

Authors

Institutions

Publication Details

Journal
Communications of the ACM
Published
2024-09-03
DOI
https://doi.org/10.1145/3677384
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Faster Integer Programming

Don Monroe
Communications of the ACM
Cryptography and Data Security
article

Faster Integer Programming

Don Monroe
article en

Abstract

A new analysis proves that all integer programs theoretically could be solved much faster than previously guaranteed.

Communications of the ACMVol. 67(10)
Middlebury College (US)
Openalex Percentile: Top 88%
Cryptography and Data Security
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Faster Integer Programming — Don Monroe · Communications of the ACM (2024) | TGRS Research Map | TGRS