2657 search results - page 112 / 532 » On the complexity of hierarchical problem solving |
111
click to vote
ANTSW
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
125
click to vote
CATA
2004
15 years 3 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
134
click to vote
IWOCA
2010
Springer
14 years 8 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
116
click to vote
CIMCA
2005
IEEE
15 years 7 months ago
2005
IEEE
We present some proposals to approximately solve a period vehicle routing problem used to model the extraction of oil from a set of onshore oil wells in Brazil. This problem diffe...
103
click to vote
HEURISTICS
2010
14 years 8 months ago
2010
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...