Circuit and Graver Walks and Linear and Integer Programming
<|reference_start|>Circuit and Graver Walks and Linear and Integer Programming: We show that a circuit walk from a given feasible point of a given linear program to an optimal point can be computed in polynomial time using only linear algebra operations and the solution of the single given linear program.   We also show that a Graver walk from a given feasible point of a given integer program to an optimal point is polynomial time computable using an integer programming oracle, but without such an oracle, it is hard to compute such a walk even if an optimal solution to the given program is given as well.   Combining our oracle algorithm with recent results on sparse integer programming, we also show that Graver walks from any point are polynomial time computable over matrices of bounded tree-depth and subdeterminants.<|reference_end|>
@article{onn2024circuit,
    title={Circuit and Graver Walks and Linear and Integer Programming},
    author={Shmuel Onn},
    journal={Discrete Optimization, 54:100862 (7 pages), 2024},
    year={2024},
    doi={10.1016/j.disopt.2024.100862},
    archivePrefix={arXiv},
    eprint={2410.00656},
    primaryClass={math.OC cs.DM cs.DS math.CO}
}