53327 search results - page 10600 / 10666 » or 2007 |
IOR
2007
13 years 8 months ago
2007
We compare two inventory systems, one in which excess demand is lost and the other in which excess demand is backordered. Both systems are reviewed periodically. They experience t...
TCS
2008
13 years 8 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
IOR
2007
13 years 8 months ago
2007
We analyze a general market for an industry of competing service facilities. Firms differentiate themselves by their price levels and the waiting time their customers experience,...
IOR
2007
13 years 8 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
TCS
2008
13 years 8 months ago
2008
Our society is increasingly moving towards richer forms of information exchange where mobility of processes and devices plays a prominent role. This tendency has prompted the acad...