Arie Tamir

Comput. Oper. Res., 2001

2000

Aggregation Error Bounds for a Class of Location Models.

[BibT_eX]

[DOI]

Richard L. Francis

Timothy J. Lowe

Oper. Res., 2000

Optimal Facility Location Under Various Distance Functions.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2000

1999

A p-center grid-positioning aggregation procedure.

[BibT_eX]

[DOI]

M. Brenda Rayco

Richard L. Francis

Comput. Oper. Res., 1999

1998

A polynomial algorithm for the p-centdian problem on a tree.

[BibT_eX]

[DOI]

Dionisio Pérez-Brito

José A. Moreno-Pérez

Networks, 1998

A maximum b-matching problem arising from median location models with applications to the roommates problem.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Math. Program., 1998

Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

1997

Structured p-facility location problems on the line solvable in polynomial time.

[BibT_eX]

[DOI]

Vernon Ning Hsu

Timothy J. Lowe

Oper. Res. Lett., 1997

Approximation algorithms for maximum dispersion.

[BibT_eX]

[DOI]

Shlomi Rubinstein

Oper. Res. Lett., 1997

1996

Capacitated Location Problems on a Line.

[BibT_eX]

[DOI]

Prakash Mirchandani

Rajeev Kohli

Transp. Sci., 1996

An O(pn2) algorithm for the p-median and related problems on tree graphs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1996

On the location of a tree-shaped facility.

[BibT_eX]

[DOI]

Networks, 1996

1995

Least Majorized Elements and Generalized Polymatroids.

[BibT_eX]

[DOI]

Math. Oper. Res., 1995

On the Minimum Diameter Spanning Tree Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

1994

A distance constrained p-facility location problem on the real line.

[BibT_eX]

[DOI]

Math. Program., 1994

1993

On the Core of Cost Allocation Games Defined on Location Problems.

[BibT_eX]

[DOI]

Transp. Sci., 1993

Complexity results for the p-median problem with mutual communication.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1993

Linear time algorithms for some separable quadratic programming problems.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1993

The least element property of center location on tree networks with applications to distance and precedence constrained problems.

[BibT_eX]

[DOI]

Math. Program., 1993

A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks.

[BibT_eX]

[DOI]

Math. Program., 1993

Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality.

[BibT_eX]

[DOI]

Math. Program., 1993

A Unifying Location Model on Tree Graphs Based on Submodularity Properties.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

Locating Service Centers with Precedence Constraints.

[BibT_eX]

[DOI]

Y. Kaufman

Discret. Appl. Math., 1993

1992

Technical Note - On the Complexity of Some Classes of Location Problems.

[BibT_eX]

[DOI]

Transp. Sci., 1992

The generalized P-forest problem on a tree network.

[BibT_eX]

[DOI]

Timothy J. Lowe

Networks, 1992

On a tree-shaped facility location problem of Minieka.

[BibT_eX]

[DOI]

Ramon Rabinovitch

Networks, 1992

Distance-constrained multifacility minimax location problems on tree networks.

[BibT_eX]

[DOI]

Erhan Erkut

Richard L. Francis

Networks, 1992

1991

Obnoxious Facility Location on Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1991

Improved complexity bounds for location problems on the real line.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1991

On the core of network synthesis games.

[BibT_eX]

[DOI]

Math. Program., 1991

1990

Algebraic Optimization: The Fermat-Weber Location Problem.

[BibT_eX]

[DOI]

R. Chandrasekaran

Math. Program., 1990

1989

Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem.

[BibT_eX]

[DOI]

Ramaswamy Chandrasekaran

Math. Program., 1989

Maximizing Classes of Two-Parameter Objectives Over Matroids.

[BibT_eX]

[DOI]

Math. Oper. Res., 1989

Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems.

[BibT_eX]

[DOI]

Oper. Res., 1989

1988

Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

The minimax multistop location problem on a tree.

[BibT_eX]

[DOI]

Oded Berman

David Simchi-Levi

Networks, 1988

1987

On the Solution Value of the Continuous p-Center Location Problem on a Graph.

[BibT_eX]

[DOI]

Math. Oper. Res., 1987

Totally balanced and totally unimodular matrices defined by center location problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1987

1985

A finite algorithm for the continuousp-center location problem on a graph.

[BibT_eX]

[DOI]

Math. Program., 1985

Minimum cost flow algorithms for series-parallel networks.

[BibT_eX]

[DOI]

Wolfgang W. Bein

Peter Brucker

Discret. Appl. Math., 1985

1984

Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games.

[BibT_eX]

[DOI]

R. Chandrasekaran

Math. Program., 1984

Polynomial testing of the query "IS ab ≥ cd?" with application to finding a minimal cost reliability ratio spanning tree.

[BibT_eX]

[DOI]

Ramaswamy Chandrasekaran

Discret. Appl. Math., 1984

1983

New Results on the Complexity of p-Center Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1983

1982

On the complexity of locating linear facilities in the plane.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1982

Polynomially bounded algorithms for locating p-centers on a tree.

[BibT_eX]

[DOI]

R. Chandrasekaran

Math. Program., 1982

Locating Centers on a Tree with Discontinuous Supply and Demand Regions.

[BibT_eX]

[DOI]

Eitan Zemel

Math. Oper. Res., 1982

On the solution of discrete bottleneck problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1982

1981

An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1981

1980

An O ((nlog p)2) Algorithm for the Continuous p-Center Problem on a Tree.

[BibT_eX]

[DOI]

Ramaswamy Chandrasekaran

SIAM J. Algebraic Discret. Methods, 1980

The use of jacobi's lemma in unimodularity theory.

[BibT_eX]

[DOI]

Moshe Kress

Math. Program., 1980

1978

An O(N log N) Algorithm for a Class of Matching Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1978

1977

Ergodicity and symmetric mathematical programs.

[BibT_eX]

[DOI]

Math. Program., 1977

1976

On the number of solutions to the linear comple-mentarity problem.

[BibT_eX]

[DOI]

Math. Program., 1976

1974

Minimality and complementarity properties associated with Z-functions and M-functions.

[BibT_eX]

[DOI]

Math. Program., 1974

1973

On a characterization of P-matrices.

[BibT_eX]

[DOI]

Math. Program., 1973

1972

On "an efficient algorithm for minimizing barrier and penalty functions".

[BibT_eX]

[DOI]