Frank Plastria

Orcid: 0000-0001-6206-6556

Affiliations:
  • Vrije Universiteit Brussel, Belgium


According to our database1, Frank Plastria authored at least 62 papers between 1983 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Corrigendum to 'How bad can the centroid be?'[Eur. J. Oper. Res. 252 (2016) 98-102].
Eur. J. Oper. Res., March, 2024

2021
Using the power of ideal solutions: simple proofs of some old and new results in location theory.
4OR, 2021

2020
On the Structure of the Weakly Efficient Set for Quasiconvex Vector Minimization.
J. Optim. Theory Appl., 2020

2019
Pasting gauges II: Balls in pasted halfplanes.
Discret. Appl. Math., 2019

Pasting gauges I: Shortest paths across a hyperplane.
Discret. Appl. Math., 2019

2016
How bad can the centroid be?
Eur. J. Oper. Res., 2016

Up- and downgrading the euclidean 1-median problem and knapsack Voronoi diagrams.
Ann. Oper. Res., 2016

2015
Location of weighted anti-ordered median straight lines with Euclidean distances.
Discret. Appl. Math., 2015

2014
Multi-instance classification through spherical separation and VNS.
Comput. Oper. Res., 2014

Location-arc routing problem: Heuristic approaches and test instances.
Comput. Oper. Res., 2014

Single-facility huff location problems on networks.
Ann. Oper. Res., 2014

Linear separation and approximation by minimizing the sum of concave functions of distances.
4OR, 2014

2013
Locating a semi-obnoxious covering facility with repelling polygonal regions.
Discret. Appl. Math., 2013

The ordered anti-median problem with distances derived from a strictly convex norm.
Discret. Appl. Math., 2013

2012
Minmax-distance approximation and separation problems: geometrical properties.
Math. Program., 2012

2010
The <i>k</i>-Centrum Straight-line Location Problem.
J. Math. Model. Algorithms, 2010

Finding an Euclidean anti-k-centrum location of a set of points.
Comput. Oper. Res., 2010

Alternating local search based VNS for linear classification.
Ann. Oper. Res., 2010

Eleven surveys in operations research: II.
Ann. Oper. Res., 2010

Multi-dimensional Data Inspection for Supervised Classification with Eigen Transformation Classification Trees.
Proceedings of the PRICAI 2010: Trends in Artificial Intelligence, 2010

2009
On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems.
OR Spectr., 2009

Maximal covering location problem with price decision for revenue maximization in a competitive environment.
OR Spectr., 2009

Assessing Spatial Data Infrastructure Policy Strategies Using the Multi-Actor Multi-Criteria Analysis.
Int. J. Spatial Data Infrastructures Res., 2009

Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models.
Comput. Oper. Res., 2009

On the point for which the sum of the distances to <i>n</i> given points is minimum.
Ann. Oper. Res., 2009

Asymmetric distances, semidirected networks and majority in Fermat-Weber problems.
Ann. Oper. Res., 2009

Preface.
Ann. Oper. Res., 2009

Plagiarism again: Sreenivas and Srinivas, with an update on Marcu.
4OR, 2009

No 7-year itch at <i>4OR</i>.
4OR, 2009

2-class Eigen Transformation Classification Trees.
Proceedings of the KDIR 2009 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval, Funchal, 2009

2008
Optimal Expected-Distance Separating Halfspace.
Math. Oper. Res., 2008

Equity-Efficiency Bicriteria Location with Squared Euclidean Distances.
Oper. Res., 2008

Discrete models for competitive location with foresight.
Comput. Oper. Res., 2008

Dimensionality Reduction for Classification.
Proceedings of the Advanced Data Mining and Applications, 4th International Conference, 2008

2007
Editorial.
Oper. Res., 2007

On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification.
INFORMS J. Comput., 2007

S. Nickel and J. Puerto, Location Theory: A Unified Approach, Springer (2005) ISBN 3-540-24321-6 XXI+437p.
Eur. J. Oper. Res., 2007

Solving a Huff-like competitive location and design model for profit maximization in the plane.
Eur. J. Oper. Res., 2007

Eleven surveys in Operations Research.
Ann. Oper. Res., 2007

Preface.
Ann. Oper. Res., 2007

Formulation Space Search for Circle Packing Problems.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

2006
Euclidean push-pull partial covering problems.
Comput. Oper. Res., 2006

A case of plagiarism: Danut Marcu.
4OR, 2006

<i>4OR</i>: Year 4.
4OR, 2006

2005
Reformulation descent applied to circle packing problems.
Comput. Oper. Res., 2005

2004
Optimal location and design of a competitive facility.
Math. Program., 2004

2003
Acknowledgement to referees.
4OR, 2003

4OR for what purpose?
4OR, 2003

2002
Formulating logical implications in combinatorial optimisation.
Eur. J. Oper. Res., 2002

Discrete location problems with push-pull objectives.
Discret. Appl. Math., 2002

An Extended Multifacility Minimax Location Problem Revisited.
Ann. Oper. Res., 2002

2001
Static competitive facility location: An overview of optimisation approaches.
Eur. J. Oper. Res., 2001

2000
Dominators for Multiple-objective Quasiconvex Maximization Problems.
J. Glob. Optim., 2000

1999
Undesirable facility location with minimal covering objectives.
Eur. J. Oper. Res., 1999

1998
Locating an Undesirable Facility by Generalized Cutting Planes.
Math. Oper. Res., 1998

1996
A characterization of efficient points in constrained location problems with regional demand.
Oper. Res. Lett., 1996

1995
On minquantile and maxcovering optimisation.
Math. Program., 1995

1993
A Note on "A Special Problem on Rectangular Floorplans Solvable in Polynomial Time" of G. Bär.
J. Inf. Process. Cybern., 1993

1992
On destination optimality in asymmetric distance Fermat-Weber problems.
Ann. Oper. Res., 1992

1991
Sufficient Conditions for Coincidence in Minisum Multifacility Location Problems with a General Metric.
Oper. Res., 1991

1986
Two hierarchies associated with each clustering scheme.
Pattern Recognit., 1986

1983
Non-hierarchical clustering with masloc.
Pattern Recognit., 1983


  Loading...