13987 search results - page 465 / 2798 » The Two Guards Problem |
187
click to vote
MP
2006
15 years 7 months ago
2006
We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be ...
206
click to vote
DAM
1999
15 years 6 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
182
click to vote
CPAIOR
2010
Springer
15 years 5 months ago
2010
Springer
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
200
click to vote
JETAI
2010
15 years 5 months ago
2010
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemi...
257
click to vote
ALGORITHMICA
2011
15 years 2 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...