Integer program with bimodular matrix
S. I. Veselov, A. Ju. Chirkov
TL;DR
This paper investigates integer programming problems characterized by bimodular matrices, aiming to improve understanding and solution techniques for this class of optimization problems.
Contribution
It introduces new theoretical insights and algorithms specifically designed for integer programs with bimodular matrices.
Findings
Enhanced solution methods for bimodular integer programs
Theoretical bounds on problem complexity
Potential applications in combinatorial optimization
Abstract
This paper has been accepted for publication in Discrete Optimization.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Packing Problems · Vehicle Routing Optimization Methods