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
Citation: Za. Liang et al., Optimality conditions and duality for a class of nonlinear fractional programming problems, J OPTIM TH, 110(3), 2001, pp. 611-619
Citation: Hx. Huang et Pm. Pardalos, New algorithm for the conical combination representation problem of a vector, J OPTIM TH, 109(3), 2001, pp. 495-519
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
Citation: Dw. Kim et Pm. Pardalos, A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems, J GLOB OPT, 17(1-4), 2000, pp. 225-234
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
Citation: D. Kim et Pm. Pardalos, Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems, NETWORKS, 35(3), 2000, pp. 216-222
Citation: D. Kim et Pm. Pardalos, A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure, OPER RES L, 24(4), 1999, pp. 195-203