151 search results - page 28 / 31 » The max quasi-independent set Problem |
ANOR
2002
13 years 7 months ago
2002
We introduce a distribution center (DC) location model that incorporates working inventory and safety stock inventory costs at the distribution centers. In addition, the model inco...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
ECWEB
2005
Springer
14 years 1 months ago
2005
Springer
: E-commerce customers may have a problem when paying for the purchase of a major item, if its price is larger than the available credit on their credit card. In the brick and mort...
IJIT
2004
13 years 8 months ago
2004
This paper reports work done to improve the modeling of complex processes when only small experimental data sets are available. Neural networks are used to capture the nonlinear un...
CP
2003
Springer
14 years 20 days ago
2003
Springer
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...