SIAMCO
2002
13 years 4 months ago
2002
We consider the problem of minimizing autonomous, simple integrals like (P) min T 0 f x(t) , x (t) dt: x AC([0 , T]) with x(0) = x0 and x(T) = xT where f : R
AI
2006
Springer
13 years 4 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
ACISICIS
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...