Alberto Caprara, Matteo Fischetti, Paolo Toth  Home/Search
Context Related
| or.deis.unibo.it/alberto/scpsurv.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: or.deis.unibo.it/alberto...online (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The Set Covering Problem (SCP) is a main model for several important applications, including crew scheduling in railway and mass-transit companies. (Update)
Similar documents based on text: More All
2.1: A Heuristic Method for the Set Covering Problem - Caprara, Fischetti, Toth (1995) (Correct)
1.0: An Evolutionary Algorithm for Large Scale Set Covering.. - Marchiori, Steenbeek (2000) (Correct)
1.0: A 3-Flip Neighborhood Local Search for the Set Covering.. - Mutsunori Yagiura Masahiro (2000) (Correct)
BibTeX entry: (Update)
A. Caprara, M. Fischetti, P. Toth. Algorithms for the Set Covering Problem. Technical Report No. OR-98-3. DEIS-Operations Research Group, 1998. http://citeseer.ist.psu.edu/caprara98algorithms.html More
@misc{ caprara98algorithms,
author = "A. Caprara and M. Fischetti and P. Toth",
title = "Algorithms for the Set Covering Problem",
text = "A. Caprara, M. Fischetti, P. Toth. Algorithms for the Set Covering Problem.
Technical Report No. OR-98-3. DEIS-Operations Research Group, 1998.",
year = "1998",
url = "citeseer.ist.psu.edu/caprara98algorithms.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
300 the Hardness of Approximating Minimization Problems (context) - Lund, Yannakakis - 1994
229 Knapsack Problems: Algorithms and Computer Implementations (context) - Martello, Toth - 1990
216 Performance of Various Computers Using Standard Linear Equat.. - Dongarra - 1996
154 The Traveling Salesman Problem and Minimum Spanning Trees: P.. (context) - Held, Karp - 1971
129 OR-Library: Distributing Test Problems by Electronic Mail (context) - Beasley - 1990
39 A Genetic Algorithm for the Set Covering Problem - Beasley, Chu - 1996
25 An Algorithm for Set Covering Problems (context) - Beasley - 1987
22 A Lagrangian Heuristic for Set Covering Problems (context) - Beasley - 1990
16 A Lagrangian-Based Heuristic for Large-Scale Set Covering Pr.. - Ceria, Nobili et al. - 1995
16 Enhancing an Algorithm for Set Covering Problems (context) - Beasley, Jornsten - 1992
15 A Heuristic Method for the Set Covering Problem - Caprara, Fischetti et al. - 1995
14 Algorithms for Railway Crew Management - Caprara, Fischetti et al. - 1997
13 A Dynamic Subgradient-Based Branch-and-Bound Procedure for S.. (context) - Balas, Carrera - 1996
13 A Surrogate Heuristic for Set Covering Problems (context) - Lorena, Lopes - 1994
[Article contains additional citations not shown here]
Documents on the same site (http://www.or.deis.unibo.it/alberto/online.htm): More
The Multiple Subset Sum Problem - Caprara, Kellerer, Pferschy (1998) (Correct)
A Global Method for Crew Planning in Railway Applications - Caprara, Monaci, Toth (Correct)
Exact Solution of the Quadratic Knapsack Problem - Caprara, Pisinger, Toth (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC