2738 search results - page 65 / 548 » The Frobenius Problem and Its Generalizations |
FSTTCS
2003
Springer
14 years 2 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
GECCO
2006
Springer
14 years 18 days ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
AAAI
2008
13 years 11 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
SIAMSC
2010
13 years 7 months ago
2010
Abstract. We develop duality-based a posteriori error estimates for functional outputs of solutions of free-boundary problems via shape-linearization principles. To derive an appro...