Sciweavers

4266 search results - page 115 / 854
» The container loading problem
Sort
View
NETWORKS
2006
15 years 2 months ago
Extreme point characterizations for infinite network flow problems
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith
JACM
2010
116views more  JACM 2010»
15 years 28 days ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
MP
2010
145views more  MP 2010»
15 years 27 days 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...
107
Voted
NETWORKS
2010
15 years 27 days 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 9 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