- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j39 |      | Antonio J. Lozano, Juan A. Mesa, Frank Plastria: The ordered anti-median problem with distances derived from a strictly convex norm. Discrete Applied Mathematics 161(4-5): 642-649 (2013) |
| 2012 | ||
| j38 | | Frank Plastria, Emilio Carrizosa: Minmax-distance approximation and separation problems: geometrical properties. Math. Program. 132(1-2): 153-177 (2012) |
| 2010 | ||
| j37 | | Frank Plastria, Steven De Bruyne, Emilio Carrizosa: Alternating local search based VNS for linear classification. Annals OR 174(1): 121-134 (2010) |
| j36 | | |
| j35 | | Denis Bouyssou, Silvano Martello, Frank Plastria: Eleven surveys in operations research: II. Annals OR 175(1): 3-8 (2010) |
| j34 | | Antonio J. Lozano, Juan A. Mesa, Frank Plastria: Finding an Euclidean anti-k-centrum location of a set of points. Computers & OR 37(2): 292-301 (2010) |
| j33 | | Antonio J. Lozano, Juan A. Mesa, Frank Plastria: The k-Centrum Straight-line Location Problem. J. Math. Model. Algorithms 9(1): 1-17 (2010) |
| c4 | | Steven De Bruyne, Frank Plastria: Multi-dimensional Data Inspection for Supervised Classification with Eigen Transformation Classification Trees. PRICAI 2010: 583-588 |
| 2009 | ||
| j32 | | |
| j31 | | Denis Bouyssou, Silvano Martello, Frank Plastria: Plagiarism again: Sreenivas and Srinivas, with an update on Marcu. 4OR 7(1): 17-20 (2009) |
| j30 | | |
| j29 | | Endre Weiszfeld, Frank Plastria: On the point for which the sum of the distances to n given points is minimum. Annals OR 167(1): 7-41 (2009) |
| j28 | | Frank Plastria: Asymmetric distances, semidirected networks and majority in Fermat-Weber problems. Annals OR 167(1): 121-155 (2009) |
| j27 | | Boglárka Tóth, José Fernández, Blas Pelegrín, Frank Plastria: Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models. Computers & OR 36(5): 1393-1405 (2009) |
| c3 |  | Steven De Bruyne, Frank Plastria: 2-class Eigen Transformation Classification Trees. KDIR 2009: 251-258 |
| 2008 | ||
| j26 | | Frank Plastria, Lieselot Vanhaverbeke: Discrete models for competitive location with foresight. Computers & OR 35(3): 683-700 (2008) |
| j25 | | Yoshiaki Ohsawa, Naoya Ozaki, Frank Plastria: Equity-Efficiency Bicriteria Location with Squared Euclidean Distances. Operations Research 56(1): 79-87 (2008) |
| j24 | | Emilio Carrizosa, Frank Plastria: Optimal Expected-Distance Separating Halfspace. Math. Oper. Res. 33(3): 662-677 (2008) |
| c2 | | Frank Plastria, Steven De Bruyne, Emilio Carrizosa: Dimensionality Reduction for Classification. ADMA 2008: 411-418 |
| 2007 | ||
| j23 | | |
| j22 | | Denis Bouyssou, Silvano Martello, Frank Plastria: Eleven surveys in Operations Research. Annals OR 153(1): 3-7 (2007) |
| j21 | | José Fernández, Blas Pelegrín, Frank Plastria, Boglárka Tóth: Solving a Huff-like competitive location and design model for profit maximization in the plane. European Journal of Operational Research 179(3): 1274-1287 (2007) |
| j20 | | Frank Plastria: S. Nickel and J. Puerto, Location Theory: A Unified Approach, Springer (2005) ISBN 3-540-24321-6 XXI+437p. European Journal of Operational Research 181(1): 523-525 (2007) |
| j19 | | Emilio Carrizosa, Belen Martin-Barragan, Frank Plastria, Dolores Romero Morales: On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification. INFORMS Journal on Computing 19(3): 470-479 (2007) |
| j18 | | Frank Plastria, Panagiotis Adamidis, Jason Papathanasiou: Editorial. Operational Research 7(3): 321-322 (2007) |
| c1 | | Nenad Mladenovic, Frank Plastria, Dragan Urosevic: Formulation Space Search for Circle Packing Problems. SLS 2007: 212-216 |
| 2006 | ||
| j17 | | |
| j16 | | Denis Bouyssou, Silvano Martello, Frank Plastria: A case of plagiarism: Danut Marcu. 4OR 4(1): 11-13 (2006) |
| j15 | | Yoshiaki Ohsawa, Frank Plastria, Kazuki Tamura: Euclidean push-pull partial covering problems. Computers & OR 33(12): 3566-3582 (2006) |
| 2005 | ||
| j14 | | Denis Bouyssou, Silvano Martello, Frank Plastria: Acknowledgement to referees. 4OR 3(4): 341-342 (2005) |
| j13 | | Nenad Mladenovic, Frank Plastria, Dragan Urosevic: Reformulation descent applied to circle packing problems. Computers & OR 32: 2419-2434 (2005) |
| 2004 | ||
| j12 | | Frank Plastria, Emilio Carrizosa: Optimal location and design of a competitive facility. Math. Program. 100(2): 247-265 (2004) |
| 2003 | ||
| j11 | | |
| j10 | | Denis Bouyssou, Silvano Martello, Frank Plastria: Acknowledgement to referees. 4OR 1(4): 347-348 (2003) |
| 2002 | ||
| j9 | | C. Michelot, Frank Plastria: An Extended Multifacility Minimax Location Problem Revisited. Annals OR 111(1-4): 167-179 (2002) |
| j8 | | Jakob Krarup, David Pisinger, Frank Plastria: Discrete location problems with push-pull objectives. Discrete Applied Mathematics 123(1-3): 363-378 (2002) |
| j7 | | Frank Plastria: Formulating logical implications in combinatorial optimisation. European Journal of Operational Research 140(2): 338-353 (2002) |
| 2001 | ||
| j6 | | Frank Plastria: Static competitive facility location: An overview of optimisation approaches. European Journal of Operational Research 129(3): 461-470 (2001) |
| 1999 | ||
| j5 | | Frank Plastria, Emilio Carrizosa: Undesirable facility location with minimal covering objectives. European Journal of Operational Research 119(1): 158-180 (1999) |
| 1995 | ||
| j4 | | Emilio Carrizosa, Frank Plastria: On minquantile and maxcovering optimisation. Math. Program. 71: 101-112 (1995) |
| 1993 | ||
| j3 | | Frank Plastria: A Note on "A Special Problem on Rectangular Floorplans Solvable in Polynomial Time" of G. Bär. Elektronische Informationsverarbeitung und Kybernetik 29(3): 175-178 (1993) |
| 1986 | ||
| j2 | | Frank Plastria: Two hierarchies associated with each clustering scheme. Pattern Recognition 19(2): 193-196 (1986) |
| 1983 | ||
| j1 | | Desire L. Massart, Frank Plastria, Leonard Kaufman: Non-hierarchical clustering with masloc. Pattern Recognition 16(5): 507-516 (1983) |
Colors in the list of coauthors
Last update Sat May 25 03:51:39 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page