Sciweavers

1871 search results - page 67 / 375
» The Ephemeral Pairing Problem
Sort
View
SIAMDM
2010
113views more  SIAMDM 2010»
14 years 6 months ago
The VPN Problem with Concave Costs
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanit&agra...
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
15 years 11 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
COR
2004
139views more  COR 2004»
14 years 11 months ago
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
The routing of a fleet of vehicles to service a set of customers is important in the field of distribution. Vehicle Routing Problems (VRP) arise in many real-life applications wit...
Sin C. Ho, Dag Haugland
CORR
2011
Springer
220views Education» more  CORR 2011»
14 years 6 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers
TCBB
2008
95views more  TCBB 2008»
14 years 11 months ago
Solving the Problem of Trans-Genomic Query with Alignment Tables
Abstract-- The trans-genomic query (TGQ) problem -- enabling the free query of biological information, even across genomes -- is a central challenge facing bioinformatics. Solution...
Douglas Stott Parker Jr., Ruey-Lung Hsiao, Yi Xing...