Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

COR
2010

favoriteEmaildiscussreport

77views more COR 2010»

Lower bounds for the mixed capacitated arc routing problem

13 years 8 months ago

Lower bounds for the mixed capacitated arc routing problem

Download cio.fc.ul.pt

Luís Gouveia, Maria Cândida Mour&atil

Real-time Traffic

COR 2010 | Distributed And Parallel Computing |

claim paper

Related Content

» A comparison of two different formulations for arc routing problems on mixed graphs

» Lower bounds and heuristics for the Windy Rural Postman Problem

» New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery

» Bounds and Heuristics for the Shortest Capacitated Paths Problem

» Arcsstates models for the vehicle routing problem with time windows and related problems

» Capacitated Confluent Flows Complexity and Algorithms

» Extreme point characterizations for infinite network flow problems

» New dynamic programming algorithms for the resource constrained elementary shortest path p...

» Pricing Network Edges to Cross a River

Post Info
More Details (n/a)

Added	01 Mar 2011
Updated	01 Mar 2011
Type	Journal
Year	2010
Where	COR
Authors	Luís Gouveia, Maria Cândida Mourão, Leonor Santiago Pinto

Comments (0)