Plastria Frank

Frank Plastria

Information about the author Frank Plastria will soon be added to the site.
Found 34 papers in total
Up- and downgrading the euclidean 1-median problem and knapsack Voronoi diagrams
Up- and downgrading the euclidean 1-median problem and knapsack Voronoi diagrams
2016
We consider the 1‐median problem with euclidean distances with uncertainty in...
Continuous location of an assembly station
Continuous location of an assembly station
2013
Demand existing at client points in the plane for several products should be met....
Locating fire stations: An integrated approach for Belgium
Locating fire stations: An integrated approach for Belgium
2012
This paper illustrates the potential of a decision‐support system developed for...
Alternating local search based VNS for linear classification
Alternating local search based VNS for linear classification
2010
We consider the linear classification method consisting of separating two sets of...
Asymmetric distances, semidirected networks and majority in Fermat–Weber problems
Asymmetric distances, semidirected networks and majority in Fermat–Weber problems
2009
The Fermat–Weber problem is considered with distance defined by a quasimetric,...
On the point for which the sum of the distances to n given points is minimum
On the point for which the sum of the distances to n given points is minimum
2009
Translation with annotations of E. Weiszfeld, Sur le point pour lequel la somme des...
The ordered median Euclidean straight-line location problem
The ordered median Euclidean straight-line location problem
2009
An optimal line is sought in the Euclidean plane in terms of the ordered median...
New errorbounds in continuous minisum location for aggregation at the gravity centre
New errorbounds in continuous minisum location for aggregation at the gravity centre
2000
For large scale location problems data is often only available in aggregated form....
Optimal Expected-Distance Separating Halfspace
Optimal Expected-Distance Separating Halfspace
2008
One recently proposed criterion to separate two data sets in discriminant analysis is...
On the selection of the globally optimal prototype subset for nearest‐neighbor classification
On the selection of the globally optimal prototype subset for nearest‐neighbor classification
2007
The nearest–neighbor classifier has been shown to be a powerful tool for...
Discrete models for competitive location with foresight
Discrete models for competitive location with foresight
2008
We adapt the competitive location model based on maximal covering to include the...
Solving a Huff-like competitive location and design model for profit maximization in the plane
Solving a Huff-like competitive location and design model for profit maximization in the plane
2007
A chain wants to set up a single new facility in a planar market where similar...
Locating a central hunter on the plane
Locating a central hunter on the plane
2008
Protection, surveillance or other types of coverage services of mobile points call for...
Quadratic ordered median location problems
Quadratic ordered median location problems
2007
The criteria used in location analysis have to be chosen according to the character of...
Four-point Fermat location problems revisited. New proofs and extensions of old results
Four-point Fermat location problems revisited. New proofs and extensions of old results
2006
What is the point at which the sum of (Euclidean) distances to four fixed points in...
Euclidean push–pull partial covering problems
Euclidean push–pull partial covering problems
2006
This paper considers a bicriteria model to locate a semi-obnoxious facility within a...
Reformulation descent applied to circle packing problems
Reformulation descent applied to circle packing problems
2005
Several years ago classical Euclidean geometry problems of densest packing of circles...
Avoiding cannibalisation and/or competitor reaction in planar single facility location
Avoiding cannibalisation and/or competitor reaction in planar single facility location
2005
A single facility has to be located in the plane in competition with fixed existing...
An extended multifacility minimax location problem revisited
An extended multifacility minimax location problem revisited
2002
We consider the following model of Drezner for the location of several facilities. The...
Formulating logical implications in combinatorial optimisation
Formulating logical implications in combinatorial optimisation
2002
When practical problems are formulated as combinatorial optimisation models one must...
Pentomino exclusion and spanning. IP – formulation, valid inequalities and facets
Pentomino exclusion and spanning. IP – formulation, valid inequalities and facets
2000
Pentomino exclusion asks to delete a minimum number of cells from a square grid...
Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
1998
A location is sought within some convex region of the plane for the central site of...
Discretization results for the Huff and Pareto–Huff competitive location models on networks
Discretization results for the Huff and Pareto–Huff competitive location models on networks
1998
In this paper we prove that there always exists a finite set that includes an optimal...
Static competitive facility location: An overview of optimisation approaches
Static competitive facility location: An overview of optimisation approaches
2001
We give an overview of the research, models and literature about optimisation...
Papers per page: