Papers that cite:


FEO TA, RESENDE MGC
A PROBABILISTIC HEURISTIC FOR A COMPUTATIONALLY DIFFICULT SET COVERING PROBLEM
OPERATIONS RESEARCH LETTER
8 (2): 67-71 APR 1989



                                                                               
2009
01Ronconi DP, Henriques LRSSome heuristic algorithms for total tardiness minimization in a flowshop with blocking
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE   37: 272-281  2009
2008
08Hu HL, Chen YLMining typical patterns from databases
INFORMATION SCIENCES   178:3683-3696  2008
07Gendreau M, Potvin JYMetaheuristics: A Canadian perspective
INFOR   46:71-80 2008
06Parreno F, Alvarez-Valdes R, Tamarit JM, et al.A maximal-space algorithm for the container loading problem
INFORMS JOURNAL ON COMPUTING  20:412-422    2008
05 Bertolazzi P, Felici G, Festa P, et al.Logic classification and feature selection for biomedical data
COMPUTERS & MATHEMATICS WITH APPLICATIONS    55: 889-899   2008
04 Cravo GL, Ribeiro GM, Nogueira Lorena LAA greedy randomized adaptive search procedure for the point-feature cartographic label placement
COMPUTERS & GEOSCIENCES  34: 373-386   2008
03 Bautista J, Pereira J, Adenso-Diaz B
A GRASP approach for the extended car sequencing problem
JOURNAL OF SCHEDULING   11:3-16   2008
02 Alvarez-Valdes R, Parreno F, Tamarit JM
Reactive GRASP for the strip-packing problem 
COMPUTERS & OPERATIONS RESEARCH 35 (4): 1065-1083 APR 2008
01 de Souza MC, de Carvalho CRV, Brizon WB
Packing items to feed assembly lines 
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 184 (2): 480-489 JAN 16 2008
2007
09 Umetani S, Yagiura MRelaxation heuristics for the set covering problem
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN   50: 350-375    2007
08 Umetani S, Yagiura M
Relaxation heuristics for the set covering problem
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN   50:350-375  DEC 2007
07 Festa P
On some optimization problems in molecular biology 
MATHEMATICAL BIOSCIENCES 207 (2): 219-234 JUN 2007
06 Francis, P; Zhang, GM; Smilowitz, K
Improved modeling and solution methods for the multi-resource routing problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 180 (3): 1045-1059 AUG 1 2007
05 Benvenuto N, Carnevale G, Tomasin S
Joint power control and receiver optimization of CDMA transceivers using successive interference cancellation 
IEEE TRANSACTIONS ON COMMUNICATIONS 55 (3): 563-573 MAR 2007
04 Ribeiro CC, Martins SL, Rosseti I
Metaheuristics for optimization problems in computer communications 
COMPUTER COMMUNICATIONS 30 (4): 656-669 FEB 26 2007
03 Ribeiro CC, Urrutia S
Heuristics for the mirrored traveling tournament problem 
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 179 (3): 775-787 JUN 16 2007
02 Lan, GH; DePuy, GW; Whitehouse, GE
An effective and simple heuristic for the set covering problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 176 (3): 1387-1403 FEB 1 2007
01 Grundel, DA; Krokhmal, PA; Oliveira, CAS; Pardalos, PM
On the number of local minima for the multidimensional assignment problem
JOURNAL OF COMBINATORIAL OPTIMIZATION 13 (1): 1-18 JAN 2007
2006
07 Pacheco J, Casado S, Nunez L, et al.
Analysis of new variable selection methods for discriminant analysis 
COMPUTATIONAL STATISTICS & DATA ANALYSIS 51 (3): 1463-1478 DEC 1 2006
06 Crawford, B; Castro, C; Monfroy, E
A constructive hybrid algorithm for crew pairing optimization
ARTIFICIAL INTELLIGENCE: METHODOLOGY, SYSTEMS, AND APPLICATIONS, PROCEEDINGS 4183: 45-55 2006
05
Crawford, B; Castro, C
Integrating lookahead and post processing procedures with ACO for solving set partitioning and covering problems
ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING - ICAISC 2006, PROCEEDINGS 4029:
1082-1090 2006
04
Fugenschuh A, Hofler B
Parametrized GRASP heuristics for three-index assignment 
LECTURE NOTES IN COMPUTER SCIENCE 3906: 61-72 2006
03
Goldbarg EFG, de Souza GR, Goldbarg MC
Particle swarm for the traveling salesman problem 
LECTURE NOTES IN COMPUTER SCIENCE 3906: 99-110 2006
02
Yagiura M, Kishida M, Ibaraki T
A,3-flip neighborhood local search for the set covering problem 
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 172 (2): 472-499 JUL 16 2006
01
Yepes V, Medina J
Economic heuristic optimization for heterogeneous fleet VRPHESTW 
JOURNAL OF TRANSPORTATION ENGINEERING-ASCE 132 (4): 303-311 APR 2006
2005

14
Gendreau M, Potvin JY
Metaheuristics in combinatorial optimization 
ANNALS OF OPERATIONS RESEARCH 140 (1): 189-213 NOV 2005
13
Krishnan, R; Peters, J; Padman, R; Kaplan, D
On data reliability assessment in accounting information systems
INFORMATION SYSTEMS RESEARCH, 16 (3): 307-326 SEP 2005
12
Delgado C, Laguna M, Pacheco J
Minimizing labor requirements in a periodic vehicle loading problem 
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 32 (3): 299-320 DEC 2005
11
Zhao WZ, Fanning ML, Lane T
Efficient RNAi-based gene family knockdown via set cover optimization 
ARTIFICIAL INTELLIGENCE IN MEDICINE 35 (1-2): 61-73 SEP-OCT 2005
10
Vasko FJ, Knolle PJ, Spiegel DS
An empirical study of hybrid genetic algorithms for the set covering problem 
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 56 (10): 1213-1223 OCT 2005
09
Alvarez AM, Gonzalez-Velarde JL, De-Alba K
Grasp embedded Scatter Search for the multicommodity capacitated network design problem 
JOURNAL OF HEURISTICS 11 (3): 233-257 MAY 2005
08
Pacheco JA, Casado S
Solving two location models with few facilities by using a hybrid heuristic: a real health resources case 
COMPUTERS & OPERATIONS RESEARCH 32 (12): 3075-3091 DEC 2005
07
Scaparra MP, Church RL
A GRASP and path relinking heuristic for rural road network development 
JOURNAL OF HEURISTICS 11 (1): 89-108 JAN 2005
06
Aiex RM, Resende MGC, Pardalos PM, et al.
GRASP with path relinking for three-index assignment 
INFORMS JOURNAL ON COMPUTING 17 (2): 224-247 SPR 2005
05
Casado S, Laguna M, Pacheco J
Heuristical labour scheduling to optimize airport passenger flows 
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 56 (6): 649-658 JUN 2005
04
Alvarez-Valdes R, Parreno F, Tamarit JM
A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems 
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 56 (4): 414-425 APR 2005
03
DePuy GW, Moraga RJ, Whitehouse GE
Meta-RaPS: a simple and effective approach for solving the traveling salesman problem 
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 41 (2): 115-130 MAR 2005
02
Pacheco JA
A scatter search approach for the minimum sum-of-squares clustering problem 
COMPUTERS & OPERATIONS RESEARCH 32 (5): 1325-1335 MAY 2005
01
Ahmadi S, Osman IH
Greedy random adaptive memory programming search for the capacitated clustering problem 
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 162 (1): 30-44 APR 1 2005
2004
07
Valls V, Ballestin F, Quintanilla S
A population-based approach to the resource-constrained project scheduling problem 
ANNALS OF OPERATIONS RESEARCH 131 (1-4): 305-324 OCT 2004
06
Oliveira CAS, Pardalos PM, Resende MGC
GRASP with path-relinking for the quadratic assignment problem 
LECTURE NOTES IN COMPUTER SCIENCE 3059: 356-368 2004
05
Li ZY, Guo SS, Wang F, et al.
Improved GRASP with tabu search for vehicle routing with both time window and limited number of vehicles 
LECTURE NOTES IN COMPUTER SCIENCE 3029: 552-561 2004
04
Bambha NK, Bhattacharyya SS, Teich J, et al.
Systematic integration of parameterized local search into evolutionary algorithms 
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 8 (2): 137-155 APR 2004
03
Resende MGC, Werneck RF
A hybrid heuristic for the p-median problem 
JOURNAL OF HEURISTICS 10 (1): 59-88 JAN 2004
02
Kucar D, Areibi S, Vannelli A
Hypergraph partitioning techniques 
DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES A-MATHEMATICAL ANALYSIS 11 (2-3): 339-367 APR 2004
01
Delorme X, Gandibleux X, Rodriguez J
GRASP for set packing problems 
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 153 (3): 564-580 MAR 16 2004
2003

08
Jedrzejowicz J, Jedrzejowicz P
Population-based approach to multiprocessor task scheduling in multistage hybrid flowshops 
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE 2773: 279-286 2003
07
Osman IH, Al-Ayoubi B, Barake M
A greedy random adaptive search procedure for the weighted maximal planar graph problem 
COMPUTERS & INDUSTRIAL ENGINEERING 45 (4): 635-651 DEC 2003
06
Ianovsky E, Kreimer J
Optimization of real-time multiserver system with two different channels and shortage of maintenance facilities 
MATHEMATICS AND COMPUTERS IN SIMULATION 63 (6): 615-627 NOV 24 2003
05
Jedrzejowicz J, Jedrzejowicz P
Population-based approach to multiprocessor task scheduling in multistage hybrid flowshops 
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE 2773: 279-286 2003
04
Margot F
Exploiting orbits in symmetric ILP 
MATHEMATICAL PROGRAMMING 98 (1-3): 3-21 SEP 2003
03
Pacheco J, Valencia O
Design of hybrids for the minimum sum-of-squares clustering problem 
COMPUTATIONAL STATISTICS & DATA ANALYSIS 43 (2): 235-248 JUN 28 2003
02
Marti R, Laguna M
Heuristics and meta-heuristics for 2-layer straight line crossing minimization 
DISCRETE APPLIED MATHEMATICS 127 (3): 665-678 MAY 1 2003
01
Aiex RM, Binato S, Resende MGC
Parallel GRASP with path-relinking for job shop scheduling 
PARALLEL COMPUTING 29 (4): 393-430 APR 2003
2002

12
Festa P, Pardalos PM, Resende MGC, et al.
Randomized heuristics for the MAX-CUT problem 
OPTIMIZATION METHODS & SOFTWARE 17 (6): 1033-1058 DEC 2002
11
Abello J, Resende MGC, Sudarsky S
Massive quasi-clique detection 
LECTURE NOTES IN COMPUTER SCIENCE 2286: 598-612 2002
10
Margot F
Pruning by isomorphism in branch-and-cut 
MATHEMATICAL PROGRAMMING 94 (1): 71-90 DEC 2002
09
Gonzalez-Velarde JL, Laguna M
Tabu search with simple ejection chains for coloring graphs 
ANNALS OF OPERATIONS RESEARCH 117 (1-4): 165-174 NOV 2002
08
Corberan A, Marti R, Sanchis JM
A GRASP heuristic for the mixed Chinese postman problem 
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 142 (1): 70-80 OCT 1 2002
07
Meuleau N, Dorigo M
Ant colony optimization and stochastic gradient descent 
ARTIFICIAL LIFE 8 (2): 103-121 2002
06
Haouari M, Chaouachi JS
A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem 
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 53 (7): 792-799 JUL 2002
05
Solar M, Parada V, Urrutia R
A parallel genetic algorithm to solve the set-covering problem 
COMPUTERS & OPERATIONS RESEARCH 29 (9): 1221-1235 AUG 2002
04
Kreimer J
Real-time system with homogeneous servers and nonidentical channels in steady-state 
COMPUTERS & OPERATIONS RESEARCH 29 (11): 1465-1473 SEP 2002
03
Aiex RM, Resende MGC, Ribeiro CC
Probability distribution of solution time in GRASP: An experimental investigation 
JOURNAL OF HEURISTICS 8 (3): 343-373 MAY 2002
02
Medeiros MC, Veiga A, Resende MGC
A combinatorial approach to piecewise linear time series analysis 
JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS 11 (1): 236-258 MAR 2002
01
Alvarez-Valdes R, Parajon A, Tamarit JM
A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems 
COMPUTERS & OPERATIONS RESEARCH 29 (7): 925-947 JUN 2002
2001

08
Fiesta P, Pardalos PM, Resende MGC
Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP 
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE 27 (4): 456-464 DEC 2001
07
Marti R, Estruch V
Incremental bipartite drawing problem 
COMPUTERS & OPERATIONS RESEARCH 28 (13): 1287-1298 NOV 2001
06
Xu JY, Chiu SY
Effective heuristic procedures for a field technician scheduling problem 
JOURNAL OF HEURISTICS 7 (5): 495-509 SEP 2001
05
Klabjan D, Johnson EL, Nemhauser GL, et al.
Solving large airline crew scheduling problems: Random pairing generation and strong branching 
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 20 (1): 73-91 OCT 2001
04
Marti R
Arc crossing minimization in graphs with GRASP 
IIE TRANSACTIONS 33 (10): 913-919 OCT 2001
03
Hammer PL, Rader DJ
Maximally disjoint solutions of the set covering problem 
JOURNAL OF HEURISTICS 7 (2): 131-144 MAR 2001
02
Medeiros MC, Resende MGC, Veiga A
Piecewise linear time series estimation with GRASP 
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 19 (2): 127-144 2001
01
Laguna M, Marti R
A GRASP for coloring sparse graphs 
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 19 (2): 165-178 2001
2000

04
Martins SL, Resende MGC, Ribeiro CC, et al.
A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy 
JOURNAL OF GLOBAL OPTIMIZATION 17 (1-4): 267-283 SEP 2000
03
Kreimer J
Real-time multiserver system with two non-identical channels and limited maintenance facilities 
MATHEMATICS AND COMPUTERS IN SIMULATION 53 (1-2): 85-94 AUG 15 2000
02
Urban TL, Chiang WC, Russell RA
The integrated machine allocation and layout problem 
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 38 (13): 2911-2930 SEP 2000
01
Kiwiel KC, Lindberg PO, Nou A
Bregman proximal relaxation of large-scale 0-1 problems 
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 15 (1): 33-44 JAN 2000
1999

04
Kreimer J
Real-time multiserver and multichannel systems with shortage of maintenance crews 
MATHEMATICAL AND COMPUTER MODELLING 30 (11-12): 169-176 DEC 1999
03
Laguna M, Marti R
GRASP and path relinking for 2-layer straight line crossing minimization 
INFORMS JOURNAL ON COMPUTING 11 (1): 44-52 WIN 1999
02
Jorjani S, Scott CH, Woodruff DL
Selection of an optimal subset of sizes 
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 37 (16): 3697-3710 NOV 10 1999
01
Fernandez E, Marti R
GRASP for seam drawing in mosaicking of aerial photographic maps 
JOURNAL OF HEURISTICS 5 (2): 181-197 JUL 1999
1998

06
Resende MGC
Computing approximate solutions of the maximum covering problem with GRASP 
JOURNAL OF HEURISTICS 4 (2): 161-177 JUL 1998
05
Kreimer J, Mehrez A
Computation of availability of a real-time system using queueing theory methodology 
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 49 (10): 1095-1100 OCT 1998
04
Rios-Mercado RZ, Bard JF
Heuristics for the flow line problem with setup costs 
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 110 (1): 76-98 OCT 1 1998
03
Ceria S, Nobili P, Sassano A
A Lagrangian-based heuristic for large-scale set covering problems 
MATHEMATICAL PROGRAMMING 81 (2): 215-228 APR 1 1998
02
Shang Y, Wah BW
A discrete Lagrangian-Based global-search method for solving satisfiability problems 
JOURNAL OF GLOBAL OPTIMIZATION 12 (1): 61-99 JAN 1998
01
Odijk MA, van Maaren H
Improved solutions to the Steiner triple covering problem 
INFORMATION PROCESSING LETTERS 65 (2): 67-69 JAN 29 1998
1997

01
Lorena LAN, Lopes LDS
Genetic algorithms applied to computationally difficult set covering problems 
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 48 (4): 440-445 APR 1997
1996

05
Feo TA, Sarathy K, McGahan J
A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties 
COMPUTERS & OPERATIONS RESEARCH 23 (9): 881-895 SEP 1996
04
Storer RH, Flanders SW, Wu SD
Problem space local search for number partitioning 
ANNALS OF OPERATIONS RESEARCH 63: 465-487 1996
03
Murray AT, Church RL
Analyzing cliques for imposing adjacency restrictions in forest models 
FOREST SCIENCE 42 (2): 166-175 MAY 1996
02
Feo TA, Bard JF, Holland SD
A GRASP for scheduling printed wiring board assembly 
IIE TRANSACTIONS 28 (2): 155-165 FEB 1996
01
Arguello MF, Feo TA, Goldschmidt O
Randomized methods for the number partitioning problem 
COMPUTERS & OPERATIONS RESEARCH 23 (2): 103-111 FEB 1996
1995

06
Storer RH, Flanders SW, Wu SD
Problem space local search for number partitioning 
ANNALS OF OPERATIONS RESEARCH 63: 465-487 1996
05
Feo TA, GonzalezVelarde JL
The intermodal trailer assignment problem 
TRANSPORTATION SCIENCE 29 (4): 330-341 NOV 1995
04
MANNINO C, SASSANO A
SOLVING HARD SET COVERING PROBLEMS 
OPERATIONS RESEARCH LETTERS 18 (1): 1-5 AUG 1995
03
FEO TA, BARD JF, HOLLAND SD
FACILITY-WIDE PLANNING AND SCHEDULING OF PRINTED WIRING BOARD ASSEMBLY 
OPERATIONS RESEARCH 43 (2): 219-230 MAR-APR 1995
02
WEDELIN D
AN ALGORITHM FOR LARGE-SCALE 0-1-INTEGER PROGRAMMING WITH APPLICATION TO AIRLINE CREW SCHEDULING 
ANNALS OF OPERATIONS RESEARCH 57: 283-301 1995
01
FEO TA, RESENDE MGC
GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES 
JOURNAL OF GLOBAL OPTIMIZATION 6 (2): 109-133 MAR 1995
1994

03
KLINCEWICZ JG, RAJAN A
USING GRASP TO SOLVE THE COMPONENT GROUPING PROBLEM 
NAVAL RESEARCH LOGISTICS 41 (7): 893-912 DEC 1994
02
FEO TA, RESENDE MGC, SMITH SH
A GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE FOR MAXIMUM INDEPENDENT SET 
OPERATIONS RESEARCH 42 (5): 860-878 SEP-OCT 1994
01
LAGUNA M, FEO TA, ELROD HC
A GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE FOR THE 2-PARTITION PROBLEM 
OPERATIONS RESEARCH 42 (4): 677-687 JUL-AUG 1994
1993

01
LAGUNA M, BARNES JW, GLOVER F
INTELLIGENT SCHEDULING WITH TABU SEARCH - AN APPLICATION TO JOBS WITH LINEAR DELAY PENALTIES AND SEQUENCE-DEPENDENT SETUP COSTS AND TIMES 
APPLIED INTELLIGENCE 3 (2): 159-172 JUN 1993
1991

03
KARMARKAR N, RESENDE MGC, RAMAKRISHNAN KG
AN INTERIOR POINT ALGORITHM TO SOLVE COMPUTATIONALLY DIFFICULT SET COVERING PROBLEMS 
MATHEMATICAL PROGRAMMING 52 (3): 597-618 DEC 1991
02
FEO TA, VENKATRAMAN K, BARD JF
A GRASP-STAR FOR A DIFFICULT SINGLE-MACHINE SCHEDULING PROBLEM 
COMPUTERS & OPERATIONS RESEARCH 18 (8): 635-643 1991
01
LAGUNA M, VELARDE JLG
A SEARCH HEURISTIC FOR JUST-IN-TIME SCHEDULING IN PARALLEL MACHINES 
JOURNAL OF INTELLIGENT MANUFACTURING 2 (4): 253-260 AUG 1991