Sciweavers

8647 search results - page 162 / 1730
» The Container Selection Problem
Sort
View
MP
2010
145views more  MP 2010»
15 years 1 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
NETWORKS
2010
15 years 1 months ago
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be...
Jean-François Cordeau, Manuel Iori, Gilbert...
NETWORKS
2010
15 years 1 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
IROS
2009
IEEE
131views Robotics» more  IROS 2009»
15 years 10 months ago
Visual Place Categorization: Problem, dataset, and algorithm
Abstract— In this paper we describe the problem of Visual Place Categorization (VPC) for mobile robotics, which involves predicting the semantic category of a place from image me...
Jianxin Wu, Henrik I. Christensen, James M. Rehg
HICSS
2005
IEEE
157views Biometrics» more  HICSS 2005»
15 years 8 months ago
A Two-Stage Heuristic for the Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles
The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem in logistics. The problem is to serve a number of customers at minimum cost without violating the cus...
Andrew Lim, Xingwen Zhang