← All problems

Gomory corner polyhedron edge-count problem

This entry tracks Gomory corner polyhedron edge-count problem.

It gives the first progress beyond the standard vertex-pair estimate.

Latest development

The edge-count bound becomes O(n6^n(1+log_2(2δ))^{2n−3}).

Editorial caveat

The optimal edge count remains unknown.

References

Source: arXiv

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.