14386 search results - page 256 / 2878 » The Chinese Generals Problem |
154
click to vote
CSR
2009
Springer
15 years 5 months ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
109
Voted
COR
2010
15 years 4 months ago
2010
In this paper, we consider the recovery of an airline schedule after an unforeseen event called disruption, making the planned schedule infeasible. We present a modeling framework...
140
click to vote
ENTCS
2008
15 years 4 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...
120
click to vote
COR
2007
15 years 4 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 ...
140
click to vote
EOR
2007
15 years 4 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ļ...