Back to search

Total Citations Per Year

Abstract

References (30)

Lagrangian Relaxation for Integer Programming

2009 • 996 citations

A Dual-Based Procedure for Uncapacitated Facility Location

1978 • 922 citations

Central Facilities Location

1970 • 828 citations

Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

1977 • 807 citations

A Heuristic Program for Locating Warehouses

1976 • 745 citations

Note—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms”

1979 • 452 citations

Lagrangean decomposition: A model yielding stronger lagrangean bounds

1987 • 421 citations

An Efficient Branch and Bound Algorithm for the Warehouse Location Problem

1972 • 292 citations

A comparison of heuristics and relaxations for the capacitated plant location problem

1991 • 275 citations

A Cross Decomposition Algorithm for Capacitated Facility Location

1986 • 267 citations

An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem

1977 • 236 citations

Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem

1977 • 227 citations

Combinatorial optimization and vehicle fleet planning: Perspectives and prospects

1981 • 158 citations

Plant location, Set Covering and Economic Lot Size: An 0 (mn)-Algorithm for Structured Problems

1977 • 144 citations

Lot-size models with backlogging: Strong reformulations and cutting planes

1988 • 137 citations

An Improved Algorithm for the Capacitated Facility Location Problem

1978 • 125 citations

An algorithm for the solution of the 0–1 knapsack problem

1982 • 125 citations

Implicit representation of variable upper bounds in linear programming

1975 • 117 citations

Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem

1969 • 109 citations

Lagrangian relaxation for the star‐star concentrator location problem: Approximation algorithm and bounds

1985 • 106 citations

A direct dual method for the mixed plant location problem with some side constraints

1979 • 92 citations

On the Extent to Which Certain Fixed-Charge Depot Location Problems can be Solved by LP

1978 • 80 citations

Plant Location with Generalized Search Origin

1969 • 66 citations

Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem

1991 • 60 citations

Lagrangean decomposition for integer programming : theory and applications

1987 • 59 citations

Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem

1980 • 49 citations

A projection method for the uncapacitated facility location problem

1990 • 40 citations

Facility location models for planning a transatlantic communications network

1981 • 22 citations

A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem

1989 • 18 citations

A search tree algorithm for plant location problems

1981 • 13 citations

Cited By (0)

Loading...