Name
Abstract | ||
|---|---|---|
The resource constrained elementary shortest path problem (RCESPP) arises as a pricing subproblem in branch-and-price algorithms for vehicle-routing problems with additional constraints. We address the optimization of the RCESPP and we present and compare ... |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1002/net.v51:3 | Networks |
Keywords | Field | DocType |
multicommodity flow,routing,rounding,randomized algorithms | Randomized algorithm,Mathematical optimization,Combinatorics,Expander graph,Disjoint sets,Path length,Rounding,Multi-commodity flow problem,Mathematics | Journal |
Volume | Issue | ISSN |
51 | 3 | 0028-3045 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alok Baveja | 1 | 120 | 11.99 |