arbiter
JournalsPricingAccount

Inverse of the Gomory corner relaxation of integer programs

George Lyu et al.

Discrete Optimization2026https://doi.org/10.1016/j.disopt.2026.100943article
AJG 2
Weight
0.50

What the paper says

We explore the inverse of integer programs (IPs) by studying the inverse of their Gomory corner relaxations (GCRs). We propose a linear programming (LP) formulation for solving any inverse GCR problem under the L 1 and L ∞ norms by reformulating the inverse GCR problem as the inverse of a shortest path problem. We show that the minimum objective of the inverse GCR across all feasible bases of the LP relaxation yields an upper bound on the optimal value of the inverse IP that is at least as tight as the optimal value of the inverse of the LP relaxation. We provide conditions under which this upper bound is exactly equal to the optimal value of the inverse IP.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1016/j.disopt.2026.100943

Or copy a formatted citation

@article{george2026,
  title        = {{Inverse of the Gomory corner relaxation of integer programs}},
  author       = {George Lyu et al.},
  journal      = {Discrete Optimization},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1016/j.disopt.2026.100943},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Inverse of the Gomory corner relaxation of integer programs

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.