Resende Mauricio G.C.

Mauricio G.C. Resende

Information about the author Mauricio G.C. Resende will soon be added to the site.
Found 13 papers in total
A fast swap-based local search procedure for location problems
A fast swap-based local search procedure for location problems
2007
We present a new implementation of a widely used swap-based local search procedure for...
GRASP with path relinking for three-index assignment
GRASP with path relinking for three-index assignment
2005
This paper proposes and tests variants of GRASP (greedy randomized adaptive search...
An annotated bibliography of network interior point methods
An annotated bibliography of network interior point methods
2003
This paper presents an annotated bibliography on interior point methods for solving...
Randomized heuristics for the max-cut problem
Randomized heuristics for the max-cut problem
2002
Given an undirected graph with edge weights, the max-cutproblem consists in finding a...
A GRASP with path-relinking for private virtual circuit routing
A GRASP with path-relinking for private virtual circuit routing
2003
A frame relay service offers virtual private networks to customers by provisioning a...
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
2000
This paper describes Fortran subroutines for computing approximate solutions to the...
A GRASP for the biquadratic assignment problem
A GRASP for the biquadratic assignment problem
1998
The biquadratic assignment problem (BiQAP) is a generalization of the quadratic...
Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming
Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming
1995
An example of the quadratic assignment problem (QAP) is the facility location problem,...
A greedy randomized adaptive search procedure for maximum independent set
A greedy randomized adaptive search procedure for maximum independent set
1994
An efficient randomized heuristic for a maximum independent set is presented. The...
A continuous approach to inductive inference
A continuous approach to inductive inference
1992
In this paper the authors describe an interior point mathematical programming approach...
An interior point algorithm to solve computationally difficult set covering problems
An interior point algorithm to solve computationally difficult set covering problems
1991
The authors present an interior point approach to the zero-one integer programming...
A probabilistic heuristic for a computational difficult set covering problem
A probabilistic heuristic for a computational difficult set covering problem
1989
An efficient probabilistic set covering heuristic is presented. The heuristic is...
An implementation of Karmarkar’s algorithm for linear programming
An implementation of Karmarkar’s algorithm for linear programming
1989
This paper describes the implementation of power series dual affine scaling variants...
Papers per page: