NETWORKS 2010 - PDF Preprint Papers

NETWORKS 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed NETWORKS-2010 Paper

click to vote

NETWORKS
2010

347views Computer Networks» more NETWORKS 2010»

A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading

13 years 11 months ago

Download www.cs.uwaterloo.ca

In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each deﬁned by an origin location where a load must be...

Jean-François Cordeau, Manuel Iori, Gilbert...

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	347	A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading	claim
2	321	Computational experience with a SDP-based algorithm for maximum cut with limited unbalance	claim
3	178	A branch-and-cut algorithm for partition coloring	claim
4	170	SNDlib 1.0 - Survivable Network Design Library	claim
5	165	Integrating facility location and production planning decisions	claim
6	155	Complexity of some inverse shortest path lengths problems	claim
7	153	A mean-variance model for the minimum cost flow problem with stochastic arc costs	claim
8	148	Fixed-parameter tractability results for full-degree spanning tree and its dual	claim
9	139	Gossiping and routing in undirected triple-loop networks	claim
10	135	Probabilistic models for the Steiner Tree problem	claim
11	133	Mixed search number and linear-width of interval and split graphs	claim
12	133	Optimal permutation routing for low-dimensional hypercubes	claim
13	132	Network flow spanners	claim
14	126	Simultaneous embeddings of graphs as median and antimedian subgraphs	claim
15	125	A polyhedral study of the network pricing problem with connected toll arcs	claim
16	123	Optical index of fault tolerant routings in WDM networks	claim
17	123	An ejection chain algorithm for the quadratic assignment problem	claim
18	122	k-Splittable delay constrained routing problem: A branch-and-price approach	claim
19	118	The regenerator location problem	claim
20	118	Minimal selectors and fault tolerant networks	claim
21	115	Optimal routing with failure-independent path protection	claim
22	112	Almost sure asymptotic optimality for online routing and machine scheduling problems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers