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