14165 search results - page 221 / 2833 » The generalized two-server problem |
146
click to vote
ENTCS
2008
15 years 5 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
121
Voted
COR
2007
15 years 5 months ago
2007
The paper discusses the deļ¬nition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
144
Voted
EOR
2007
15 years 5 months ago
2007
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proļ...
152
click to vote
IANDC
2007
15 years 5 months ago
2007
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
149
click to vote
MOR
2007
15 years 4 months ago
2007
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the proļ¬ts of each of the edges is maximized. The set M is...