default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank Plastria
Person information
- affiliation: Vrije Universiteit Brussel, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j61]Richard L. Church, Zvi Drezner
, Frank Plastria, Arie Tamir:
Reviewing extensions and solution methods of the planar Weber single facility location problem. Comput. Oper. Res. 173: 106825 (2025)- 2024
- [j60]Frank Plastria:
Corrigendum to 'How bad can the centroid be?'[Eur. J. Oper. Res. 252 (2016) 98-102]. Eur. J. Oper. Res. 313(2): 814-815 (2024) - 2021
- [j59]Frank Plastria:
Using the power of ideal solutions: simple proofs of some old and new results in location theory. 4OR 19(3): 449-467 (2021) - 2020
- [j58]Frank Plastria:
On the Structure of the Weakly Efficient Set for Quasiconvex Vector Minimization. J. Optim. Theory Appl. 184(2): 547-564 (2020)
2010 – 2019
- 2019
- [j57]Frank Plastria:
Pasting gauges I: Shortest paths across a hyperplane. Discret. Appl. Math. 256: 105-137 (2019) - [j56]Frank Plastria:
Pasting gauges II: Balls in pasted halfplanes. Discret. Appl. Math. 256: 138-156 (2019) - 2016
- [j55]Frank Plastria:
Up- and downgrading the euclidean 1-median problem and knapsack Voronoi diagrams. Ann. Oper. Res. 246(1-2): 227-251 (2016) - [j54]Frank Plastria:
How bad can the centroid be? Eur. J. Oper. Res. 252(1): 98-102 (2016) - 2015
- [j53]Antonio Jose Lozano, Juan A. Mesa, Frank Plastria:
Location of weighted anti-ordered median straight lines with Euclidean distances. Discret. Appl. Math. 182: 122-133 (2015) - 2014
- [j52]Frank Plastria, Emilio Carrizosa:
Linear separation and approximation by minimizing the sum of concave functions of distances. 4OR 12(1): 77-85 (2014) - [j51]Rafael Blanquero, Emilio Carrizosa, Amaya Nogales-Gómez, Frank Plastria:
Single-facility huff location problems on networks. Ann. Oper. Res. 222(1): 175-195 (2014) - [j50]Rui Borges Lopes, Frank Plastria, Carlos Ferreira, Beatriz Sousa Santos:
Location-arc routing problem: Heuristic approaches and test instances. Comput. Oper. Res. 43: 309-317 (2014) - [j49]Frank Plastria, Emilio Carrizosa, José Gordillo:
Multi-instance classification through spherical separation and VNS. Comput. Oper. Res. 52: 326-333 (2014) - 2013
- [j48]Antonio J. Lozano, Juan A. Mesa, Frank Plastria:
The ordered anti-median problem with distances derived from a strictly convex norm. Discret. Appl. Math. 161(4-5): 642-649 (2013) - [j47]Frank Plastria, José Gordillo, Emilio Carrizosa:
Locating a semi-obnoxious covering facility with repelling polygonal regions. Discret. Appl. Math. 161(16-17): 2604-2623 (2013) - 2012
- [j46]Frank Plastria, Emilio Carrizosa:
Minmax-distance approximation and separation problems: geometrical properties. Math. Program. 132(1-2): 153-177 (2012) - 2010
- [j45]Frank Plastria, Steven De Bruyne, Emilio Carrizosa:
Alternating local search based VNS for linear classification. Ann. Oper. Res. 174(1): 121-134 (2010) - [j44]Denis Bouyssou, Silvano Martello, Frank Plastria:
Preface. Ann. Oper. Res. 175(1): 1 (2010) - [j43]Denis Bouyssou, Silvano Martello, Frank Plastria:
Eleven surveys in operations research: II. Ann. Oper. Res. 175(1): 3-8 (2010) - [j42]Antonio J. Lozano, Juan A. Mesa, Frank Plastria:
Finding an Euclidean anti-k-centrum location of a set of points. Comput. Oper. Res. 37(2): 292-301 (2010) - [j41]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
2000 – 2009
- 2009
- [j40]Denis Bouyssou, Silvano Martello, Frank Plastria:
No 7-year itch at 4OR. 4OR 7(1): 1-15 (2009) - [j39]Denis Bouyssou, Silvano Martello, Frank Plastria:
Plagiarism again: Sreenivas and Srinivas, with an update on Marcu. 4OR 7(1): 17-20 (2009) - [j38]Zvi Drezner, Frank Plastria:
Preface. Ann. Oper. Res. 167(1): 1-6 (2009) - [j37]Endre Weiszfeld, Frank Plastria:
On the point for which the sum of the distances to n given points is minimum. Ann. Oper. Res. 167(1): 7-41 (2009) - [j36]Frank Plastria:
Asymmetric distances, semidirected networks and majority in Fermat-Weber problems. Ann. Oper. Res. 167(1): 121-155 (2009) - [j35]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. Comput. Oper. Res. 36(5): 1393-1405 (2009) - [j34]Tessa Geudens, Cathy Macharis, Frank Plastria, Joep Crompvoets:
Assessing Spatial Data Infrastructure Policy Strategies Using the Multi-Actor Multi-Criteria Analysis. Int. J. Spatial Data Infrastructures Res. 4: 265-297 (2009) - [j33]Frank Plastria, Lieselot Vanhaverbeke:
Maximal covering location problem with price decision for revenue maximization in a competitive environment. OR Spectr. 31(3): 555-571 (2009) - [j32]Boglárka Tóth, Frank Plastria, José Fernández, Blas Pelegrín:
On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems. OR Spectr. 31(3): 601-627 (2009) - [c3]Steven De Bruyne, Frank Plastria:
2-class Eigen Transformation Classification Trees. KDIR 2009: 251-258 - 2008
- [j31]Frank Plastria, Lieselot Vanhaverbeke:
Discrete models for competitive location with foresight. Comput. Oper. Res. 35(3): 683-700 (2008) - [j30]Yoshiaki Ohsawa, Naoya Ozaki, Frank Plastria:
Equity-Efficiency Bicriteria Location with Squared Euclidean Distances. Oper. Res. 56(1): 79-87 (2008) - [j29]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
- [j28]Denis Bouyssou, Silvano Martello, Frank Plastria:
Preface. Ann. Oper. Res. 153(1): 1 (2007) - [j27]Denis Bouyssou, Silvano Martello, Frank Plastria:
Eleven surveys in Operations Research. Ann. Oper. Res. 153(1): 3-7 (2007) - [j26]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. Eur. J. Oper. Res. 179(3): 1274-1287 (2007) - [j25]Frank Plastria:
S. Nickel and J. Puerto, Location Theory: A Unified Approach, Springer (2005) ISBN 3-540-24321-6 XXI+437p. Eur. J. Oper. Res. 181(1): 523-525 (2007) - [j24]Emilio Carrizosa, Belen Martin-Barragan, Frank Plastria, Dolores Romero Morales:
On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification. INFORMS J. Comput. 19(3): 470-479 (2007) - [j23]Frank Plastria, Panagiotis Adamidis, Jason Papathanasiou:
Editorial. Oper. Res. 7(3): 321-322 (2007) - [c1]Nenad Mladenovic, Frank Plastria, Dragan Urosevic:
Formulation Space Search for Circle Packing Problems. SLS 2007: 212-216 - 2006
- [j22]Denis Bouyssou, Silvano Martello, Frank Plastria:
4OR: Year 4. 4OR 4(1): 1-9 (2006) - [j21]Denis Bouyssou, Silvano Martello, Frank Plastria:
A case of plagiarism: Danut Marcu. 4OR 4(1): 11-13 (2006) - [j20]Yoshiaki Ohsawa, Frank Plastria, Kazuki Tamura:
Euclidean push-pull partial covering problems. Comput. Oper. Res. 33(12): 3566-3582 (2006) - 2005
- [j19]Denis Bouyssou, Silvano Martello, Frank Plastria:
Acknowledgement to referees. 4OR 3(4): 341-342 (2005) - [j18]Nenad Mladenovic, Frank Plastria, Dragan Urosevic:
Reformulation descent applied to circle packing problems. Comput. Oper. Res. 32: 2419-2434 (2005) - 2004
- [j17]Frank Plastria, Emilio Carrizosa:
Optimal location and design of a competitive facility. Math. Program. 100(2): 247-265 (2004) - 2003
- [j16]Denis Bouyssou, Silvano Martello, Frank Plastria:
4OR for what purpose? 4OR 1(1): 1-6 (2003) - [j15]Denis Bouyssou, Silvano Martello, Frank Plastria:
Acknowledgement to referees. 4OR 1(4): 347-348 (2003) - 2002
- [j14]Christian Michelot, Frank Plastria:
An Extended Multifacility Minimax Location Problem Revisited. Ann. Oper. Res. 111(1-4): 167-179 (2002) - [j13]Jakob Krarup, David Pisinger, Frank Plastria:
Discrete location problems with push-pull objectives. Discret. Appl. Math. 123(1-3): 363-378 (2002) - [j12]Frank Plastria:
Formulating logical implications in combinatorial optimisation. Eur. J. Oper. Res. 140(2): 338-353 (2002) - 2001
- [j11]Frank Plastria:
Static competitive facility location: An overview of optimisation approaches. Eur. J. Oper. Res. 129(3): 461-470 (2001) - 2000
- [j10]Emilio Carrizosa, Frank Plastria:
Dominators for Multiple-objective Quasiconvex Maximization Problems. J. Glob. Optim. 18(1): 35-58 (2000)
1990 – 1999
- 1999
- [j9]Frank Plastria, Emilio Carrizosa:
Undesirable facility location with minimal covering objectives. Eur. J. Oper. Res. 119(1): 158-180 (1999) - 1998
- [j8]Emilio Carrizosa, Frank Plastria:
Locating an Undesirable Facility by Generalized Cutting Planes. Math. Oper. Res. 23(3): 680-694 (1998) - 1996
- [j7]Emilio Carrizosa, Frank Plastria:
A characterization of efficient points in constrained location problems with regional demand. Oper. Res. Lett. 19(3): 129-134 (1996) - 1995
- [j6]Emilio Carrizosa, Frank Plastria:
On minquantile and maxcovering optimisation. Math. Program. 71: 101-112 (1995) - 1993
- [j5]Frank Plastria:
A Note on "A Special Problem on Rectangular Floorplans Solvable in Polynomial Time" of G. Bär. J. Inf. Process. Cybern. 29(3): 175-178 (1993) - 1992
- [j4]Frank Plastria:
On destination optimality in asymmetric distance Fermat-Weber problems. Ann. Oper. Res. 40(1): 355-369 (1992) - 1991
- [j3]Odile Lefebvre, Christian Michelot, Frank Plastria:
Sufficient Conditions for Coincidence in Minisum Multifacility Location Problems with a General Metric. Oper. Res. 39(3): 437-442 (1991)
1980 – 1989
- 1986
- [j2]Frank Plastria:
Two hierarchies associated with each clustering scheme. Pattern Recognit. 19(2): 193-196 (1986) - 1983
- [j1]Desire L. Massart, Frank Plastria, Leonard Kaufman:
Non-hierarchical clustering with masloc. Pattern Recognit. 16(5): 507-516 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
