AAAAAA

   
Results: 1-7 |
Results: 7
THE MINIMUM COVERING L(PB)-HYPERSPHERE PROBLEM
Authors: PELEGRIN B CANOVAS L
Citation: B. Pelegrin et L. Canovas, THE MINIMUM COVERING L(PB)-HYPERSPHERE PROBLEM, COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 9(1), 1998, pp. 85-97
A NEW ASSIGNMENT RULE TO IMPROVE SEED POINTS ALGORITHMS FOR THE CONTINUOUS K-CENTER PROBLEM
Authors: PELEGRIN B CANOVAS L
Citation: B. Pelegrin et L. Canovas, A NEW ASSIGNMENT RULE TO IMPROVE SEED POINTS ALGORITHMS FOR THE CONTINUOUS K-CENTER PROBLEM, European journal of operational research, 104(2), 1998, pp. 366-374
THE RETURN PLANT LOCATION PROBLEM - MODELING AND RESOLUTION
Authors: MARIN A PELEGRIN B
Citation: A. Marin et B. Pelegrin, THE RETURN PLANT LOCATION PROBLEM - MODELING AND RESOLUTION, European journal of operational research, 104(2), 1998, pp. 375-392
ON THE SUM-MAX BICRITERION PATH PROBLEM
Authors: PELEGRIN B FERNANDEZ P
Citation: B. Pelegrin et P. Fernandez, ON THE SUM-MAX BICRITERION PATH PROBLEM, Computers & operations research, 25(12), 1998, pp. 1043-1054
DECOPOL - CODES FOR DECOMPOSING A POLYGON INTO CONVEX SUBPOLYGONS
Authors: FERNANDEZ J CANOVAS L PELEGRIN B
Citation: J. Fernandez et al., DECOPOL - CODES FOR DECOMPOSING A POLYGON INTO CONVEX SUBPOLYGONS, European journal of operational research, 102(1), 1997, pp. 242-243
A BRANCH-AND-BOUND ALGORITHM FOR THE TRANSPORTATION PROBLEM WITH LOCATION OF P TRANSSHIPMENT POINTS
Authors: MARIN A PELEGRIN B
Citation: A. Marin et B. Pelegrin, A BRANCH-AND-BOUND ALGORITHM FOR THE TRANSPORTATION PROBLEM WITH LOCATION OF P TRANSSHIPMENT POINTS, Computers & operations research, 24(7), 1997, pp. 659-678
NEW HEURISTIC ALGORITHMS FOR THE RECTANGULAR P-COVER PROBLEM
Authors: PELEGRIN B CANOVAS L
Citation: B. Pelegrin et L. Canovas, NEW HEURISTIC ALGORITHMS FOR THE RECTANGULAR P-COVER PROBLEM, RAIRO. Recherche operationnelle, 29(1), 1995, pp. 73-91
Risultati: 1-7 |