AAAAAA
Results:
1-9
|
Results: 9
Authors:
Medeiros, MC
Resende, MGC
Veiga, A
Citation: Mc. Medeiros et al., Piecewise linear time series estimation with GRASP, COMPUT OP A, 19(2), 2001, pp. 127-144
Authors:
Abello, J
Butenko, S
Pardalos, PM
Resende, MGC
Citation: J. Abello et al., Finding independent sets in a graph using continuous multivariable polynomial formulations, J GLOB OPT, 21(2), 2001, pp. 111-137
Authors:
Canuto, SA
Resende, MGC
Ribeiro, CC
Citation: Sa. Canuto et al., Local search with perturbations for the prize-collecting Steiner tree problem in graphs, NETWORKS, 38(1), 2001, pp. 50-58
Authors:
Resende, MGC
Pitsoulis, LS
Pardalos, PM
Citation: Mgc. Resende et al., Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP, DISCR APP M, 100(1-2), 2000, pp. 95-113
Authors:
Martins, SL
Resende, MGC
Ribeiro, CC
Pardalos, PM
Citation: Sl. Martins et al., A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy, J GLOB OPT, 17(1-4), 2000, pp. 267-283
Authors:
Portugal, LF
Resende, MGC
Veiga, G
Judice, JJ
Citation: Lf. Portugal et al., A truncated primal-infeasible dual-feasible network interior point method, NETWORKS, 35(2), 2000, pp. 91-108
Authors:
Pardalos, PM
Qian, TB
Resende, MGC
Citation: Pm. Pardalos et al., A greedy randomized adaptive search procedure for the Feedback Vertex Set Problem, J COMB OPTI, 2(4), 1999, pp. 399-412
Authors:
Ribeiro, C
Resende, MGC
Citation: C. Ribeiro et Mgc. Resende, Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP, ACM T MATH, 25(3), 1999, pp. 341-352
Authors:
Resende, MGC
Feo, TA
Smith, SH
Citation: Mgc. Resende et al., Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP, ACM T MATH, 24(4), 1998, pp. 386-394
Risultati:
1-9
|