Sciweavers

57 search results - page 2 / 12
» Ore-type graph packing problems
Sort
View
AISS
2010
161views more  AISS 2010»
13 years 2 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
ESA
2004
Springer
103views Algorithms» more  ESA 2004»
13 years 10 months ago
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
Michael R. Fellows, Christian Knauer, Naomi Nishim...
DM
2008
88views more  DM 2008»
13 years 5 months ago
Packing triangles in low degree graphs and indifference graphs
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
Gordana Manic, Yoshiko Wakabayashi
CPC
2007
50views more  CPC 2007»
13 years 4 months ago
Ore-type graph packing problems
Alexandr V. Kostochka, Gexin Yu