Back to search

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

Data up to Jan 2025

Published1991
Citations275
References35

Total Citations Per Year

Abstract

References (35)

Computers and Intractability: A Guide to the Theory of NP-Completeness

1979 • 45,565 citations

Integer and Combinatorial Optimization

1990 • 5,699 citations

Paths, Trees, and Flowers

1965 • 2,165 citations

The ellipsoid method and its consequences in combinatorial optimization

1981 • 2,062 citations

Paths, Trees, and Flowers

2009 • 1,627 citations

INTEGER AND COMBINATORIAL OPTIMIZATION

1989 • 1,115 citations

Lagrangean relaxation for integer programming

1974 • 1,056 citations

Lagrangian Relaxation for Integer Programming

2009 • 996 citations

A Dual-Based Procedure for Uncapacitated Facility Location

1978 • 922 citations

A Heuristic Program for Locating Warehouses

1976 • 745 citations

A Heuristic Program for Locating Warehouses

1963 • 606 citations

Lagrangean decomposition: A model yielding stronger lagrangean bounds

1987 • 421 citations

A Cross Decomposition Algorithm for Capacitated Facility Location

1986 • 267 citations

Lagrangean Relaxation Applied to Capacitated Facility Location Problems

1978 • 248 citations

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

1977 • 236 citations

A branch‐bound algorithm for the capacitated facilities location problem

1969 • 182 citations

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

1977 • 144 citations

Locational analysis

1983 • 141 citations

Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem

1983 • 139 citations

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

1988 • 137 citations

Heuristics for the capacitated plant location model

1983 • 128 citations

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

1982 • 125 citations

An Improved Algorithm for the Capacitated Facility Location Problem

1978 • 125 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

On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets

1983 • 100 citations

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

1979 • 92 citations

An operator theory of parametric programming for the transportation problem‐I

1972 • 83 citations

An efficient heuristic procedure for the uncapacitated warehouse location problem

1973 • 76 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

ADD-heuristics' starting procedures for capacitated plant location models

1985 • 51 citations

An efficient heuristic procedure for the capacitated warehouse location problem

1974 • 41 citations

Facility location models for planning a transatlantic communications network

1981 • 22 citations

Linear Relaxations of the Capacitated Warehouse Location Problem

1982 • 18 citations

Cited By (0)

Loading...