Privatized rural postman problems
Computers and Operations Research
On the general routing polytope
Discrete Applied Mathematics
Graphical Models, Exponential Families, and Variational Inference
Foundations and Trends® in Machine Learning
The Clustered Prize-Collecting Arc Routing Problem
Transportation Science
Minimum cut bases in undirected networks
Discrete Applied Mathematics
Minimum distance computation of LDPC codes using a branch and cut algorithm
IEEE Transactions on Communications
A Branch-and-Cut method for the Capacitated Location-Routing Problem
Computers and Operations Research
| Hi-index | 0.01 |