The Clustered Prize-Collecting Arc Routing Problem
Transportation Science
A Branch-and-Cut method for the Capacitated Location-Routing Problem
Computers and Operations Research
The Windy Clustered Prize-Collecting Arc-Routing Problem
Transportation Science
Parallel implementations of gusfield's cut tree algorithm
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem
SIAM Journal on Discrete Mathematics
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
Operations Research
| Hi-index | 0.01 |
The famous Padberg-Rao separation algorithm for $b$-matching polyhedra can be implemented to run in $\mathcal{O}(|V|^2|E|\log(|V|^2/|E|))$ time in the uncapacitated case, and in $\mathcal{O}(|V||E|^2\log(|V|^2/|E|))$ time in the capacitated case. We give a new and simple algorithm for the capacitated case which can be implemented to run in $\mathcal{O}(|V|^2|E|\log(|V|^2/|E|))$ time.