Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem

DOI10.1287/MNSC.25.1.107zbMath0446.90026OpenAlexW1977189695MaRDI QIDQ3892037

Theodore D. Klastorin

Publication date: 1979

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.25.1.107

zbMATH Keywords

generalized assignment problemfacility locationmaximal covering location problempublic sector location problems

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (19)

A study of the bottleneck single source transportation problem ⋮ A genetic algorithm for the generalised assignment problem ⋮ Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches ⋮ Tabu search for the multilevel generalized assignment problem ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ Effective algorithm and heuristic for the generalized assignment problem. ⋮ On a discrete nonlinear and nonseparable knapsack problem ⋮ Locational analysis ⋮ Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach ⋮ A survey of algorithms for the generalized assignment problem ⋮ A tabu search heuristic for the generalized assignment problem ⋮ A hybrid algorithm for the generalized assignment problem ⋮ Formulating and solving production planning problems ⋮ An algorithm for the bottleneck generalized assignment problem ⋮ Lagrangean/surrogate relaxation for generalized assignment problems ⋮ Relaxation heuristics for a generalized assignment problem ⋮ Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study ⋮ Solving capacitated clustering problems ⋮ A set partitioning heuristic for the generalized assignment problem

This page was built for publication: Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem