| Publication | Date of Publication | Type |
|---|
Extensions to the Weber problem
Computers & Operations Research | 2022-06-22 | Paper |
The nestedness property of the convex ordered median location problem on a tree
Discrete Optimization | 2020-07-30 | Paper |
The nestedness property of location problems on the line
Top | 2018-08-28 | Paper |
Revisiting \(k\)-sum optimization
Mathematical Programming. Series A. Series B | 2017-10-27 | Paper |
The geometric maximum traveling salesman problem
Journal of the ACM | 2015-11-12 | Paper |
Improved algorithms for some competitive location centroid problems on paths, trees and graphs
Algorithmica | 2013-06-25 | Paper |
Centdian computation in cactus graphs
Journal of Graph Algorithms and Applications | 2012-12-04 | Paper |
Minimax regret single-facility ordered median location problems on networks
INFORMS Journal on Computing | 2012-07-28 | Paper |
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
Discrete Applied Mathematics | 2012-05-30 | Paper |
A cooperative location game based on the 1-center location problem
European Journal of Operational Research | 2011-08-10 | Paper |
Minimax flow tree problems
Networks | 2010-11-24 | Paper |
Centdian Computation for Sensor Networks
Lecture Notes in Computer Science | 2010-06-17 | Paper |
On the planar piecewise quadratic 1-center problem
Algorithmica | 2010-03-23 | Paper |
New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
Operations Research Letters | 2009-11-17 | Paper |
Optimal algorithms for the path/tree-shaped facility location problems in trees
Algorithmica | 2009-10-23 | Paper |
An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
Operations Research Letters | 2009-08-14 | Paper |
Collection depots facility location problems in trees
Networks | 2009-07-28 | Paper |
Optimal location with equitable loads
Annals of Operations Research | 2009-06-25 | Paper |
Aggregation error for location models: Survey and analysis
Annals of Operations Research | 2009-06-25 | Paper |
Center location problems on tree graphs with subtree-shaped customers
Discrete Applied Mathematics | 2009-03-09 | Paper |
| The bi-criteria doubly weighted center-median path problem on a tree | 2009-02-26 | Paper |
New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Minimum \(L_k\) path partitioning-an illustration of the Monge property
Operations Research Letters | 2008-05-29 | Paper |
Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
Algorithms and Computation | 2008-04-24 | Paper |
Efficient algorithms for center problems in cactus networks
Theoretical Computer Science | 2007-07-09 | Paper |
The bi‐criteria doubly weighted center‐median path problem on a tree
Networks | 2006-09-12 | Paper |
Locating two obnoxious facilities using the weighted maximin criterion
Operations Research Letters | 2006-01-18 | Paper |
One-way and round-trip center location problems
Discrete Optimization | 2005-10-10 | Paper |
Conditional location of path and tree shaped facilities on trees
Journal of Algorithms | 2005-08-01 | Paper |
Locating tree-shaped facilities using the ordered median objective
Mathematical Programming. Series A. Series B | 2005-04-19 | Paper |
A framework for demand point and solution space aggregation analysis for location models
European Journal of Operational Research | 2004-11-22 | Paper |
An improved algorithm for the distance constrainedp-center location problem with mutual communication on tree networks
Networks | 2004-08-20 | Paper |
Continuous bottleneck tree partitioning problems
Discrete Applied Mathematics | 2004-08-06 | Paper |
Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems
Naval Research Logistics | 2004-03-15 | Paper |
Sorting weighted distances with applications to objective function evaluations in single facility location problems.
Operations Research Letters | 2004-03-15 | Paper |
Improved algorithms for several network location problems with equality measures.
Discrete Applied Mathematics | 2003-09-22 | Paper |
Algorithmic results for ordered median problems
Operations Research Letters | 2003-04-02 | Paper |
Minimizing the sum of the \(k\) largest functions in linear time.
Information Processing Letters | 2003-01-22 | Paper |
| scientific article; zbMATH DE number 1803760 (Why is no real title available?) | 2002-09-22 | Paper |
| A polynomial algorithm for thep-centdian problem on a tree | 2002-07-21 | Paper |
Worst-case incremental analysis for a class ofp-facility location problems
Networks | 2002-07-01 | Paper |
The centdian subtree on tree networks
Discrete Applied Mathematics | 2002-06-24 | Paper |
Aggregation Error Bounds for a Class of Location Models
Operations Research | 2002-06-04 | Paper |
OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
International Journal of Computational Geometry & Applications | 2002-06-02 | Paper |
The \(k\)-centrum multi-facility location problem
Discrete Applied Mathematics | 2001-09-25 | Paper |
A \(p\)-center grid-positioning aggregation procedure
Computers & Operations Research | 2000-07-25 | Paper |
The single facility location problem with minimum distance constraints
Location Science | 1999-04-26 | Paper |
Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
Discrete Applied Mathematics | 1998-11-03 | Paper |
Structured \(p\)-facility location problems on the line solvable in polynomial time
Operations Research Letters | 1998-03-18 | Paper |
A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem
Mathematical Programming. Series A. Series B | 1998-03-11 | Paper |
On the minimum diameter spanning tree problem
Information Processing Letters | 1997-02-28 | Paper |
An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
Operations Research Letters | 1997-01-07 | Paper |
| scientific article; zbMATH DE number 961964 (Why is no real title available?) | 1997-01-07 | Paper |
Approximation algorithms for maximum dispersion
Operations Research Letters | 1997-01-01 | Paper |
Capacitated Location Problems on a Line
Transportation Science | 1996-08-06 | Paper |
Least Majorized Elements and Generalized Polymatroids
Mathematics of Operations Research | 1996-02-25 | Paper |
A distance constrained \(p\)-facility location problem on the real line
Mathematical Programming. Series A. Series B | 1995-05-30 | Paper |
Complexity results for the \(p\)-median problem with mutual communication
Operations Research Letters | 1994-07-25 | Paper |
The least element property of center location on tree networks with applications to distance and precedence constrained problems
Mathematical Programming. Series A. Series B | 1994-04-12 | Paper |
A unifying location model on tree graphs based on submodularity property
Discrete Applied Mathematics | 1994-02-22 | Paper |
Linear time algorithms for some separable quadratic programming problems
Operations Research Letters | 1993-11-28 | Paper |
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
Mathematical Programming. Series A. Series B | 1993-08-30 | Paper |
On the Core of Cost Allocation Games Defined on Location Problems
Transportation Science | 1993-06-29 | Paper |
Technical Note—On the Complexity of Some Classes of Location Problems
Transportation Science | 1993-02-25 | Paper |
On a tree-shaped facility location problem of Minieka
Networks | 1993-01-17 | Paper |
Minimal Length Curves That Are Not Embeddable in an Open Planar Set: The Problem of a Lost Swimmer with a Compass
SIAM Journal on Control and Optimization | 1993-01-16 | Paper |
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
Mathematical Programming. Series A. Series B | 1993-01-01 | Paper |
The generalized P‐forest problem on a tree network
Networks | 1992-07-23 | Paper |
Distance-constrained multifacility minimax location problems on tree networks
Networks | 1992-06-28 | Paper |
Obnoxious Facility Location on Graphs
SIAM Journal on Discrete Mathematics | 1992-06-27 | Paper |
Improved complexity bounds for location problems on the real line
Operations Research Letters | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 9246 (Why is no real title available?) | 1992-06-25 | Paper |
On the core of network synthesis games
Mathematical Programming. Series A. Series B | 1991-01-01 | Paper |
Algebraic optimization: The Fermat-Weber location problem
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
Maximizing Classes of Two-Parameter Objectives Over Matroids
Mathematics of Operations Research | 1989-01-01 | Paper |
On the core of a traveling salesman cost allocation game
Operations Research Letters | 1989-01-01 | Paper |
Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems
Operations Research | 1989-01-01 | Paper |
Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
The minimax multistop location problem on a tree
Networks | 1988-01-01 | Paper |
On the Solution Value of the Continuous p-Center Location Problem on a Graph
Mathematics of Operations Research | 1987-01-01 | Paper |
Totally balanced and totally unimodular matrices defined by center location problems
Discrete Applied Mathematics | 1987-01-01 | Paper |
Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
SIAM Journal on Algebraic Discrete Methods | 1986-01-01 | Paper |
Minimum cost flow algorithms for series-parallel networks
Discrete Applied Mathematics | 1985-01-01 | Paper |
A finite algorithm for the continuousp-center location problem on a graph
Mathematical Programming | 1985-01-01 | Paper |
Polynomial testing of the query Is \(a^ b\geq c^ d?\) with application to finding a minimal cost reliability ratio spanning tree
Discrete Applied Mathematics | 1984-01-01 | Paper |
Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
Mathematical Programming | 1984-01-01 | Paper |
On the integrality of an extreme solution to pluperfect graph and balanced systems
Operations Research Letters | 1984-01-01 | Paper |
New Results on the Complexity of p-Centre Problems
SIAM Journal on Computing | 1983-01-01 | Paper |
Finding Least-Distances Lines
SIAM Journal on Algebraic Discrete Methods | 1983-01-01 | Paper |
A Class of Balanced Matrices Arising from Location Problems
SIAM Journal on Algebraic Discrete Methods | 1983-01-01 | Paper |
On the complexity of locating linear facilities in the plane
Operations Research Letters | 1982-01-01 | Paper |
Polynomially bounded algorithms for locatingp-centers on a tree
Mathematical Programming | 1982-01-01 | Paper |
Locating Centers on a Tree with Discontinuous Supply and Demand Regions
Mathematics of Operations Research | 1982-01-01 | Paper |
On the solution of discrete bottleneck problems
Discrete Applied Mathematics | 1982-01-01 | Paper |
An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
SIAM Journal on Computing | 1981-01-01 | Paper |
Efficient Algorithms for a Selection Problem with Nested Constraints and Its Application to a Production-Sales Planning Model
SIAM Journal on Control and Optimization | 1980-01-01 | Paper |
An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree
SIAM Journal on Algebraic Discrete Methods | 1980-01-01 | Paper |
The use of jacobi's lemma in unimodularity theory
Mathematical Programming | 1980-01-01 | Paper |
Scheduling jobs to two machines subject to batch arrival ordering
Naval Research Logistics Quarterly | 1979-01-01 | Paper |
An $O(N \cdot \log N)$ Algorithm for a Class of Matching Problems
SIAM Journal on Computing | 1978-01-01 | Paper |
A further note on market equilibrium with fixed supply
Journal of Economic Theory | 1977-01-01 | Paper |
Ergodicity and symmetric mathematical programs
Mathematical Programming | 1977-01-01 | Paper |
On the number of solutions to the linear comple-mentarity problem
Mathematical Programming | 1976-01-01 | Paper |
Line Search Techniques Based on Interpolating Polynomials using Function Values Only
Management Science | 1976-01-01 | Paper |
An Application of Z-Matrices to a Class of Resource Allocation Problems
Management Science | 1976-01-01 | Paper |
An Efficient One Dimensional Search Procedure
Management Science | 1975-01-01 | Paper |
Minimality and complementarity properties associated with Z-functions and M-functions
Mathematical Programming | 1974-01-01 | Paper |
On a characterization of P-matrices
Mathematical Programming | 1973-01-01 | Paper |
On “an efficient algorithm for minimizing barrier and penalty functions”
Mathematical Programming | 1972-01-01 | Paper |
