551 search results - page 78 / 111 » Continuous Search in Constraint Programming |
NETCOOP
2007
Springer
14 years 1 months ago
2007
Springer
In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This...
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract- Finding Golomb rulers is an extremely challenging optimization problem (with many practical applications) that has been approached by a variety of search methods in recen...
SAT
2005
Springer
14 years 1 months ago
2005
Springer
The utilization of cutting planes is a key technique in Integer Linear Programming (ILP). However, cutting planes have seldom been applied in Pseudo-Boolean Optimization (PBO) algo...
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
HM
2010
Springer
13 years 8 months ago
2010
Springer
The problem of designing workforce shifts and break patterns is a relevant employee scheduling problem that arises in many contexts, especially in service industries. The issue is ...