Back to search

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

Data up to Jan 2025

Published1985
Citations106
References23

Total Citations Per Year

Abstract

References (23)

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

1979 • 45,565 citations

The Design and Analysis of Computer Algorithms

1974 • 9,688 citations

Combinatorial Optimization: Algorithms and Complexity.

1984 • 6,247 citations

An analysis of approximations for maximizing submodular set functions—I

1978 • 4,300 citations

Combinatorial optimization:Algorithms and complexity

1984 • 3,523 citations

The Traveling-Salesman Problem and Minimum Spanning Trees

1970 • 1,431 citations

Validation of subgradient optimization

1974 • 1,360 citations

Lagrangean relaxation for integer programming

1974 • 1,056 citations

The traveling-salesman problem and minimum spanning trees: Part II

1971 • 1,010 citations

Lagrangian Relaxation for Integer Programming

2009 • 996 citations

A Dual-Based Procedure for Uncapacitated Facility Location

1978 • 922 citations

Submodular functions, matroids, and certain polyhedra

1970 • 818 citations

A Heuristic Program for Locating Warehouses

1976 • 745 citations

A Heuristic Program for Locating Warehouses

1963 • 606 citations

A Branch-Bound Algorithm for Plant Location

1966 • 422 citations

Duality in Nonlinear Programming: A Simplified Applications-Oriented Development

1971 • 319 citations

An Efficient Branch and Bound Algorithm for the Warehouse Location Problem

1972 • 292 citations

Location on Networks: Theory and Algorithms

1979 • 288 citations

Warehouse Location Under Continuous Economies of Scale

1966 • 281 citations

Large-Scale Network Topological Optimization

1977 • 278 citations

On teleprocessing system design, Part II: A method for approximating the optimal network

1966 • 211 citations

A Note on the Complexity of the Star-Star Concentrator Problem

1981 • 20 citations

Topological optimization of computer communication networks: approximate algorithms and bounds

1981 • 1 citations

Cited By (0)

Loading...