| Publication | Date of Publication | Type |
|---|
Cooperative location for competing firms under delivered pricing and demand linear in price
Networks and Spatial Economics | 2025-10-30 | Paper |
Population-based algorithm for discrete facility location with ranking of candidate locations
Journal of Computational and Applied Mathematics | 2024-12-16 | Paper |
On the existence and computation of Nash equilibrium in network competitive location under delivered pricing and price sensitive demand
Networks and Spatial Economics | 2024-01-31 | Paper |
Sequential customers' decisions in facility location with comparison-shopping
Computers & Operations Research | 2023-11-15 | Paper |
A discrete competitive facility location model with proportional and binary rules sequentially applied
Optimization Letters | 2023-05-04 | Paper |
Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule
Journal of Computational and Applied Mathematics | 2021-02-03 | Paper |
Computation of multi-facility location Nash equilibria on a network under quantity competition
Networks and Spatial Economics | 2020-10-08 | Paper |
Threshold distance versus side payment to reduce the cannibalization effect in retail chain expansion
IMA Journal of Management Mathematics | 2019-09-25 | Paper |
New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
Computers & Operations Research | 2018-07-11 | Paper |
Nash Equilibria in Network Facility Location Under Delivered Prices
Springer Optimization and Its Applications | 2018-02-14 | Paper |
Nash equilibria in location games on a network
OR Spectrum | 2017-08-25 | Paper |
Profit maximization and reduction of the cannibalization effect in chain expansion
Annals of Operations Research | 2017-03-03 | Paper |
Estimating the Pareto front of a hard bi-criterion competitive facility location problem
Advances in Stochastic and Deterministic Global Optimization | 2017-02-03 | Paper |
Isodistant points in competitive network facility location
Top | 2013-02-26 | Paper |
Finding all pure strategy Nash equilibria in a planar location game
European Journal of Operational Research | 2011-08-09 | Paper |
On Nash equilibria of a competitive location-design problem
European Journal of Operational Research | 2011-06-07 | Paper |
On a branch-and-bound approach for a Huff-like Stackelberg location problem
OR Spectrum | 2009-06-30 | Paper |
On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems
OR Spectrum | 2009-06-30 | Paper |
A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
Top | 2009-02-17 | Paper |
Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
Computers & Operations Research | 2008-12-17 | Paper |
Single facility location on a network under mill and delivered pricing
IMA Journal of Management Mathematics | 2007-11-27 | Paper |
GASUB: finding global optima to discrete location problems by a genetic-like algorithm
Journal of Global Optimization | 2007-11-14 | Paper |
The 1-center problem in the plane with independent random weights
Computers & Operations Research | 2007-10-19 | Paper |
Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
Networks and Spatial Economics | 2007-05-31 | Paper |
Solving a huff-like competitive location and design model for profit maximization in the plane
European Journal of Operational Research | 2007-02-12 | Paper |
A discrete long-term location--price problem under the assumption of discriminatory pricing: formulations and parametric analysis
European Journal of Operational Research | 2007-02-12 | Paper |
| Reconciling franchisor and franchisee: a planar biobjective competitive location and design model | 2006-11-02 | Paper |
On the sum-max bicriterion path problem.
Computers & Operations Research | 2003-09-07 | Paper |
Estimating actual distances by norm functions: A comparison between the \(l_{k,p,\theta}\)-norm and the \(l_{b_1,b_2,\theta}\)-norm and a study about the selection of the data set
Computers & Operations Research | 2002-04-03 | Paper |
Algorithms for the decomposition of a polygon into convex polygons
European Journal of Operational Research | 2001-12-05 | Paper |
Sensitivity analysis in continuous location models via interval analysis
Studies in Locational Analysis | 2001-11-11 | Paper |
The return plant location problem: Modelling and resolution
European Journal of Operational Research | 2001-02-22 | Paper |
A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem
European Journal of Operational Research | 2001-02-22 | Paper |
Using interval analysis for solving planar single-facility location problems: New discarding tests
Journal of Global Optimization | 2001-02-18 | Paper |
DECOPOL -- Codes for decomposing a polygon into convex subpolygons
European Journal of Operational Research | 2000-11-21 | Paper |
A continuous location model for siting a non-noxious undesirable facility within a geographical region
European Journal of Operational Research | 2000-07-19 | Paper |
| scientific article; zbMATH DE number 1323029 (Why is no real title available?) | 1999-12-13 | Paper |
Applying Lagrangian relaxation to the resolution of two-stage location problems
Annals of Operations Research | 1999-06-10 | Paper |
Location of paths on trees with minimal eccentricity and superior section
Top | 1999-05-31 | Paper |
The minimum covering \(l_{pb}\)-hypersphere problem
Computational Optimization and Applications | 1998-07-29 | Paper |
| scientific article; zbMATH DE number 1138448 (Why is no real title available?) | 1998-07-27 | Paper |
An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms
Top | 1998-05-06 | Paper |
A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
Computers & Operations Research | 1997-08-07 | Paper |
New heuristic algorithms for the rectangular $p$-cover problem
RAIRO - Operations Research | 1995-07-31 | Paper |
Heuristic methods for thep-center problem
RAIRO - Operations Research | 1991-01-01 | Paper |
Determination of efficient solutions for point-objective locational decision problems
Annals of Operations Research | 1989-01-01 | Paper |
| Determination of efficient points in multiple-objective location problems | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3997512 (Why is no real title available?) | 1986-01-01 | Paper |
On the uniqueness of optimal solutions in continuous location theory
European Journal of Operational Research | 1985-01-01 | Paper |
