Sciweavers

2489 search results - page 131 / 498
» On the Subgroup Distance Problem
Sort
View
EOR
2007
364views more  EOR 2007»
15 years 3 months ago
Heuristics for the mirrored traveling tournament problem
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
Celso C. Ribeiro, Sebastián Urrutia
NETWORKS
2010
15 years 2 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
HICSS
2005
IEEE
157views Biometrics» more  HICSS 2005»
15 years 9 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
ICALP
2010
Springer
15 years 8 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
BMCBI
2010
95views more  BMCBI 2010»
15 years 4 months ago
Heuristics for the inversion median problem
Background: The study of genome rearrangements has become a mainstay of phylogenetics and comparative genomics. Fundamental in such a study is the median problem: given three geno...
Vaibhav Rajan, Andrew Wei Xu, Yu Lin, Krister M. S...