Sciweavers

544 search results - page 61 / 109
» Improving Local Search for Fuzzy Scheduling Problems
Sort
View
IPCO
2010
210views Optimization» more  IPCO 2010»
13 years 6 months ago
A 3-Approximation for Facility Location with Uniform Capacities
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...
Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen G...
MFCS
2009
Springer
14 years 15 days ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
TELSYS
2011
207views Education» more  TELSYS 2011»
13 years 2 months ago
GRASP: basic components and enhancements
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
Paola Festa, Mauricio G. C. Resende
EOR
2007
111views more  EOR 2007»
13 years 8 months ago
Linear programming based algorithms for preemptive and non-preemptive RCPSP
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
Jean Damay, Alain Quilliot, Eric Sanlaville
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
14 years 5 days ago
Interaction of Query Evaluation and Buffer Management for Information Retrieval
The proliferation of the World Wide Web has brought information retrieval (IR) techniques to the forefront of search technology. To the average computer user, “searching” now ...
Björn Þór Jónsson, Michae...