14158 search results - page 235 / 2832 » Generalized switch-setting problems |
115
click to vote
COR
2007
15 years 3 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 ...
129
click to vote
EOR
2007
15 years 3 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ļ...
144
click to vote
IANDC
2007
15 years 3 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...
173
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
113
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...