NETWORKS 2007 - PDF Preprint Papers

NETWORKS 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed NETWORKS-2007 Paper

click to vote

NETWORKS
2007

144views Computer Networks» more NETWORKS 2007»

Models and branch-and-cut algorithms for pickup and delivery problems with time windows

13 years 4 months ago

Download www.diku.dk

In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...

Stefan Ropke, Jean-François Cordeau, Gilber...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	144	Models and branch-and-cut algorithms for pickup and delivery problems with time windows	claim
2	135	Survivable IP network design with OSPF routing	claim
3	127	Metaheuristics for the vehicle routing problem with loading constraints	claim
4	124	Incremental flow	claim
5	117	Acceleration of cutting-plane and column generation algorithms: Applications to network design	claim
6	109	Approximability of the k-server disconnection problem	claim
7	94	Network design arc set with variable upper bounds	claim
8	91	The maximum residual flow problem: NP-hardness with two-arc destruction	claim
9	91	Hardness of robust network design	claim
10	90	Vertex disjoint routings of cycles over tori	claim
11	87	Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints	claim
12	87	The two-median problem on Manhattan meshes	claim
13	84	A hub covering model for cargo delivery systems	claim
14	83	The vehicle rescheduling problem: Model and algorithms	claim
15	77	A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs	claim
16	75	Maximum independent set for intervals by divide and conquer with pruning	claim
17	73	Heuristic solutions for general concave minimum cost network flow problems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers