Sciweavers

1272 search results - page 94 / 255
» The Set Cover with Pairs Problem
Sort
View
MP
2006
138views more  MP 2006»
15 years 23 days ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...
103
Voted
IJLIT
2010
67views more  IJLIT 2010»
14 years 11 months ago
Interoperability-Centric Problems: New Challenges and Legal Solutions
Whereas abandonment of detailed regulation is widely asserted to be the true way along with the fluctuations of the business models and emergence of IP-based services, there are s...
Turgut Ayhan Beydogan
COMPGEOM
1995
ACM
15 years 4 months ago
The Rectangle Enclosure and Point-Dominance Problems Revisited
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...
Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid...
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 5 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
118
Voted
SIAMDM
2010
113views more  SIAMDM 2010»
14 years 7 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...