Computational experience with approximation algorithms for the set covering problem
Article Abstract:
A comparative study of nine different approximation algorithms reveals that the randomized greedy algorithm is best on random problems and on one set of combinatorial problems. The study also reveals that the best algorithm on the second set of combinatorial problems is the deterministic greedy variant. The study involves testing on problems with up to 500 rows and 5000 columns with the two sets of combinatorial problems having up to 28160 rows and 11264 columns.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
User Contributions:
Comment about this article or add new information about this topic:
Endurance in speed skating: the development of world records
Article Abstract:
Statistical analysis of historical data pertaining to endurance levels of different athletes for forecasting lower bounds for world records, based on technological developments of skating equipment, is presented.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2003
User Contributions:
Comment about this article or add new information about this topic:
Different methods of traffic forecast based on real data
Article Abstract:
Different methods to forecast traffic are analyzed and discussed. Two models, the constant and the linear model, for short-term forecast are examined.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Three approximation algorithms for solving the generalized segregated storage problem. The interactive analysis of the multicriteria shortest path problem by the reference point method
- Abstracts: Computation of ideal and Nadir values and implications for their use in MCDM methods. Augmented neural networks for task scheduling
- Abstracts: Progressive option bounds from the sequence of concurrently expiring options. An MCDM analysis of agricultural risk aversion
- Abstracts: A non-parametric predictive method for queues. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- Abstracts: Generalized bilinear programming: an application in farm management. A comparison of standard and two-stage mathematical programming discriminant analysis methods