1 problem

0 votes0 replies0 views
Polynomial-size exact MIP reformulation for pre-disaster planning on low-pathwidth line graphs
Let $G=(V,E)$ be the underlying graph, and let its line graph have pathwidth bounded by $k\in\mathcal{O}(\log(|V|+|E|))$ . The pre-disaster planning reformulation conjecture. The pr…
Conjectureopengraph-pathwidth mixed-integer-programming stochastic-programmingarXiv posted 2 days ago

Polynomial-size exact MIP reformulation for pre-disaster planning on low-pathwidth line graphs