- FORTRAN SUBROUTINES FOR NETWORK FLOW OPTIMIZATION USING AN INTERIOR POINT ALGORITHM
- COMPUTING APPROXIMATE SOLUTIONS OF THE MAXIMUM COVERING PROBLEM WITH GRASP
- A GRASP FOR PBX TELEPHONE MIGRATION SCHEDULING DIOGO V. ANDRADE AND MAURICIO G.C. RESENDE
- A TRUNCATED PRIMAL-INFEASIBLE DUAL-FEASIBLE NETWORK INTERIOR POINT METHOD
- METAHEURISTIC HYBRIDIZATION WITH GRASP MAURICIO G. C. RESENDE
- AN ANNOTATED BIBLIOGRAPHY OF NETWORK INTERIOR POINT METHODS
- GRASP: Procedimientos de busqueda miopes aleatorizados y adaptativos
- GRASP: GREEDY RANDOMIZED ADAPTIVE SEARCH MAURICIO G. C. RESENDE AND CELSO C. RIBEIRO
- INFORMS Journal on Computing Vol. 20, No. 2, Spring 2008, pp. 191204
- On the implementation of a swap-based local search procedure for the p-median problem
- LOCAL SEARCH WITH PERTURBATIONS FOR THE PRIZE-COLLECTING STEINER TREE PROBLEM IN GRAPHS
- A HYBRID LAGRANGEAN HEURISTIC WITH GRASP AND PATH-RELINKING FOR SET K-COVERING
- PARALLEL HYBRID HEURISTICS FOR THE PERMUTATION FLOW SHOP PROBLEM
- A CONTINUOUS GRASP TO DETERMINE THE RELATIONSHIP BETWEEN DRUGS AND ADVERSE REACTIONS
- SPEEDING UP CONTINUOUS GRASP M. J. HIRSCH, P. M. PARDALOS, AND M. G. C. RESENDE
- PIECEWISE LINEAR TIME SERIES ESTIMATION WITH GRASP MARCELO C. MEDEIROS, MAURICIO G.C. RESENDE, AND ALVARO VEIGA
- GRASP WITH PATH-RELINKING FOR NETWORK MIGRATION SCHEDULING
- A PARALLEL GRASP FOR THE STEINER TREE PROBLEM IN GRAPHS USING A HYBRID LOCAL SEARCH STRATEGY
- A BIASED RANDOM-KEY GENETIC ALGORITHM FOR THE STEINER TRIPLE COVERING PROBLEM
- A BIASED RANDOM-KEY GENETIC ALGORITHM FOR ROUTING AND WAVELENGTH ASSIGNMENT
- Discrete Optimization A hybrid multistart heuristic for the uncapacitated
- LOCAL SEARCH WITH PERTURBATIONS FOR THE PRIZECOLLECTING STEINER TREE PROBLEM IN GRAPHS
- PARALLEL GRASP WITH PATH-RELINKING FOR JOB SHOP SCHEDULING
- MAURICIO G. C. RESENDE AND CELSO C. RIBEIRO Abstract. GRASP is a multi-start metaheuristic for combinatorial optimiza-
- AN EXACT PARALLEL ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM
- AUTOMATIC TUNING OF GRASP WITH PATH-RELINKING HEURISTICS WITH A BIASED RANDOM-KEY
- Efficient Implementations of Heuristics for Routing and Wavelength Assignment
- A BIASED RANDOM-KEY GENETIC ALGORITHM FOR OSPF AND DEFT ROUTING TO MINIMIZE NETWORK CONGESTION
- GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES (GRASP) MAURICIO G.C. RESENDE
- An Interior Point Approach to the Maximum Independent Set Problem in Dense
- A BIASED RANDOM-KEY GENETIC ALGORITHM FOR JOB-SHOP SCHEDULING
- Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search
- A GENETIC ALGORITHM FOR THE RESOURCE CONSTRAINED MULTI-PROJECT SCHEDULING PROBLEM
- SOLVING SYSTEMS OF NONLINEAR EQUATIONS WITH CONTINUOUS GRASP
- Bibliography of Mauricio G.C. Resende
- FEEDBACK SET PROBLEMS PAOLA FESTA, PANOS M. PARDALOS, AND MAURICIO G.C. RESENDE
- HYBRID GRASP HEURISTICS PAOLA FESTA AND MAURICIO G.C. RESENDE
- A GRASP with path-relinking for the p-median problem Mauricio G. C. Resende Renato F. Werneck
- STRONG LOWER BOUNDS FOR THE PRIZE COLLECTING STEINER PROBLEM IN GRAPHS
- GRASP WITH PATH-RELINKING FOR THE QUADRATIC ASSIGNMENT PROBLEM
- March 20, 2006 7:59 Proceedings Trim Size: 9in x 6in ccpm-cco05 A ONE-PASS HEURISTIC FOR COOPERATIVE
- GRASP: GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES
- GRASP WITH PATH-RELINKING FOR THE COOPERATIVE COMMUNICATION PROBLEM ON AD-HOC NETWORKS
- A GRASP WITH PATH-RELINKING FOR PRIVATE VIRTUAL CIRCUIT ROUTING
- A Memetic Algorithm for OSPF Routing Luciana S. Buriol, UNICAMP, Campinas, SP, Brazil
- A PARALLEL GRASP FOR THE STEINER TREE PROBLEM IN GRAPHS USING A HYBRID LOCAL SEARCH STRATEGY
- A Fast Swap-based Local Search Procedure for Location Problems
- INFORMS Journal on Computing Vol. 17, No. 2, Spring 2005, pp. 224247
- GRASP WITH PATH-RELINKING FOR THE GENERALIZED QUADRATIC ASSIGNMENT PROBLEM
- PATH-RELINKING INTENSIFICATION METHODS FOR STOCHASTIC LOCAL SEARCH ALGORITHMS
- GRASP WITH PATH RELINKING HEURISTICS FOR THE ANTIBANDWIDTH PROBLEM
- GRASP AND PATH RELINKING FOR THE MAX-MIN DIVERSITY PROBLEM
- AN ANNOTATED BIBLIOGRAPHY OF GRASP PART I: ALGORITHMS
- A Hybrid Heuristic for the p-Median Problem Mauricio G. C. Resende
- AN OPTIMIZER IN THE TELECOMMUNICATIONS INDUSTRY MAURICIO G. C. RESENDE
- EFFECTIVE APPLICATION OF GRASP PAOLA FESTA AND MAURICIO G. C. RESENDE
- FORTRAN SUBROUTINES FOR COMPUTING APPROXIMATE SOLUTIONS OF FEEDBACK SET PROBLEMS USING GRASP
- E = {1, . . . , n}, F 2E
- BIASED RANDOM-KEY GENETIC ALGORITHMS WITH APPLICATIONS IN TELECOMMUNICATIONS
- GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES (GRASP) MAURICIO G.C. RESENDE
- CORRESPONDENCE OF PROJECTED 3-D POINTS AND LINES USING A CONTINUOUS GRASP
- Journal of Global Optimization, 6, 109134 (1995) c 1995 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- Combinator-ial and Global Optimization, pp. 297-303 P.M. Pardalos, A. Migdalas and R. Burkard, Editors
- A GENETIC ALGORITHM FOR THE WEIGHT SETTING PROBLEM IN OSPF ROUTING
- FEEDBACK SET PROBLEMS PAOLA FESTA, PANOS M. PARDALOS, AND MAURICIO G.C. RESENDE
- OPTIMIZATION PROBLEMS IN MULTICAST TREE CONSTRUCTION C.A.S. OLIVEIRA, P.M. PARDALOS, AND M.G.C. RESENDE
- Optimization Letters DOI 10.1007/s11590-006-0021-6
- GRASP WITH EVOLUTIONARY PATH-RELINKING DIOGO V. ANDRADE AND MAURICIO G. C. RESENDE
- FEEDBACK SET PROBLEMS PAOLA FESTA, PANOS M. PARDALOS, AND MAURICIO G.C. RESENDE
- GRASP: BASIC COMPONENTS AND ENHANCEMENTS PAOLA FESTA AND MAURICIO G.C. RESENDE
- A COMBINATORIAL APPROACH TO PIECEWISE LINEAR TIME SERIES ANALYSIS
- TIE Breaking: Tunable Interdomain Egress Selection Renata Teixeira Timothy G. Griffin Mauricio G. C. Resende Jennifer Rexford
- AN ANNOTATED BIBLIOGRAPHY OF GRASP PAOLA FESTA AND MAURICIO G.C. RESENDE
- PARALLEL STRATEGIES FOR GRASP WITH PATH-RELINKING RENATA M. AIEX AND MAURICIO G.C. RESENDE
- Massive Quasi-Clique Detection James Abello1
- A GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE FOR THE FEEDBACK VERTEX SET PROBLEM
- A COMBINATORIAL APPROACH TO PIECEWISE LINEAR TIME SERIES ANALYSIS
- TTTPLOTS: A PERL PROGRAM TO CREATE TIME-TO-TARGET PLOTS RENATA M. AIEX, MAURICIO G.C. RESENDE, AND CELSO C. RIBEIRO
- PARALLEL METAHEURISTICS FOR COMBINATORIAL OPTIMIZATION
- A HYBRID LAGRANGEAN HEURISTIC WITH GRASP AND PATH-RELINKING FOR SET K-COVERING
- RANDOMIZED HEURISTICS FOR THE REGENERATOR LOCATION PROBLEM
- FAST LOCAL SEARCH FOR THE MAXIMUM INDEPENDENT SET PROBLEM
- GRASP: PROCEDIMENTOS DE BUSCA GULOSOS, ALEATORIOS E ADAPTATIVOS
- C C L W H
- Restart strategies for GRASP with path-relinking heuristics
- EXPERIMENTS WITH LAGRASP HEURISTIC FOR SET K-COVERING
- A Biased Random-Key Genetic Algorithm with Forward-Backward Improvement for the Resource Constrained
- SOLVING SCALARIZED MULTI-OBJECTIVE NETWORK FLOW PROBLEMS WITH AN INTERIOR POINT METHOD
- CONTINUOUS GRASP WITH A LOCAL ACTIVE-SET METHOD FOR BOUND-CONSTRAINED GLOBAL OPTIMIZATION
- SCATTER SEARCH AND PATH-RELINKING: FUNDAMENTALS, ADVANCES, AND APPLICATIONS
- Revised GRASP with Path-Relinking for the Linear Ordering Problem
- GRASP HEURISTIC WITH PATH-RELINKING FOR THE MULTI-PLANT CAPACITATED LOT SIZING PROBLEM
- A hybrid genetic algorithm for road congestion minimization Luciana S. Buriol1
- AN ANNOTATED BIBLIOGRAPHY OF GRASP PART II: APPLICATIONS
- A RANDOM KEY BASED GENETIC ALGORITHM FOR THE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM
- A RELAX-AND-CUT ALGORITHM FOR THE PRIZE-COLLECTING STEINER PROBLEM IN GRAPHS
- Fast Local Search for the Maximum Independent Set Problem
- STREAMING CACHE PLACEMENT PROBLEMS: COMPLEXITY AND ALGORITHMS
- TIE Breaking: Tunable Interdomain Egress Selection
- A RANDOM-KEYS GENETIC ALGORITHM FOR ROUTING AND WAVELENGTH ASSIGNMENT
- A Fast Swap-based Local Search Procedure for Location Problems
- SENSOR REGISTRATION IN A SENSOR NETWORK BY CONTINUOUS GRASP
- SURVIVABLE COMPOSITE-LINK IP NETWORK DESIGN WITH OSPF ROUTING
- A GREEDY RANDOMIZED ALGORITHM FOR THE COOPERATIVE COMMUNICATION PROBLEM ON AD HOC NETWORKS
- MODELING AND SOLVING STRING SELECTION PROBLEMS C.N. MENESES, P.M. PARDALOS, M.G.C. RESENDE, AND A. VAZACOPOULOS
- A GRASP HEURISTIC FOR THE COOPERATIVE COMMUNICATION PROBLEM IN AD HOC NETWORKS
- PARALLEL GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES
- A Hybrid Genetic Algorithm for the Weight Setting Problem in OSPF/IS-IS Routing
- GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem
- GRASP WITH PATH-RELINKING: RECENT ADVANCES AND APPLICATIONS
- * AT&T Labs Research Technical Report TD-5EAL6J, September 2002. A Hybrid Genetic Algorithm for the Job Shop
- IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 20, NO. 1, FEBRUARY 2005 43 Power Transmission Network Design by Greedy
- An evolutionary algorithm for manufacturing cell formation* Jose Fernando Goncalvesa
- Network design for OSPF routing Luciana S. Buriol1, Paulo M. Franca,1
- GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES MAURICIO G.C. RESENDE AND CELSO C. RIBEIRO
- RANDOMIZED HEURISTICS FOR THE MAX-CUT PROBLEM P. FESTA, P. M. PARDALOS, M. G. C. RESENDE, AND C. C. RIBEIRO
- GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES LEONIDAS S. PITSOULIS AND MAURICIO G.C. RESENDE
- PROBABILITY DISTRIBUTION OF SOLUTION TIME IN GRASP: AN EXPERIMENTAL INVESTIGATION
- GRASP: AN ANNOTATED BIBLIOGRAPHY PAOLA FESTA AND MAURICIO G.C. RESENDE
- FINDING INDEPENDENT SETS IN A GRAPH USING CONTINUOUS MULTIVARIABLE POLYNOMIAL
- FORTRAN SUBROUTINES FOR COMPUTING APPROXIMATE SOLUTIONS OF FEEDBACK SET PROBLEMS USING GRASP
- FORTRAN SUBROUTINES FOR COMPUTING APPROXIMATE SOLUTIONS OF WEIGHTED MAX-SAT PROBLEMS
- INTERIOR POINT METHODS FOR COMBINATORIAL OPTIMIZATION JOHN E. MITCHELL, PANOS M. PARDALOS, AND MAURICIO G.C. RESENDE
- Algorithm : FORTRAN Subroutines for Approximate Solution of Dense Quadratic
- Interior point algorithms for network flow problems
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- A Progl-am for Simulation of Semiconductol-Wafer Fabrication
- LOWER BOUNDS FOR THE QUADRATIC ASSIGNMENT PROBLEM
- FEEDBACK SET PROBLEMS PAOLA FESTA, PANOS M. PARDALOS, AND MAURICIO G.C. RESENDE
- A Hybrid Multistart Heuristic for the Uncapacitated Facility Location Problem
- 43Annals of Operations Research, 25 (1990) 43-58 COMPUTATIONAL EXPERIENCE WITH AN INTERIOR POINT
- GRASP with Path Relinking for the Weighted MAXSAT Problem
- COMBINATORIAL OPTIMIZATION IN TELECOMMUNICATIONS
- A GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE FOR JOB SHOP SCHEDULING
- A parallel multi-population genetic algorithm for a constrained
- An interior point algorithm to solve computationally difficult set covering problems
- PIECEWISE LINEAR TIME SERIES ESTIMATION WITH GRASP MARCELO C. MEDEIROS, MAURICIO G.C. RESENDE, AND ALVARO VEIGA
- A Parallel GRASP for MAX-SAT Problems ? P. M. Pardalos1, L.Pitsoulis1, and M.G.C. Resende2
- A STUDY OF PRECONDITIONERS FOR NETWORK INTERIOR POINT METHODS
- :rQ-1nterSciencee -32 o I x c o v c s s o Y i , w Y o o l l l r
- GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES: ADVANCES AND APPLICATIONS
- MULTI-OBJECTIVE GRASP WITH PATH-RELINKING RAFAEL MARTI, VICENTE CAMPOS, MAURICIO G.C. RESENDE,
- A PYTHON/C LIBRARY FOR BOUND-CONSTRAINED GLOBAL OPTIMIZATION WITH CONTINUOUS GRASP
- A GRASP for the Biquadratic Assignment T. Mavridou
- HYBRIDIZATIONS OF GRASP WITH PATH-RELINKING PAOLA FESTA AND MAURICIO G.C. RESENDE
- A C++ APPLICATION PROGRAMMING INTERFACE FOR BIASED RANDOM-KEY GENETIC ALGORITHMS
- FORTRAN SUBROUTINES FOR APPROXIMATE SOLUTION OF MAXIMUM INDEPENDENT SET PROBLEMS USING GRASP
