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

DOI10.1287/MNSC.25.1.107MaRDI QIDQ3892037zbMATH OpenOpenAlexFDO

Authors 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

facility locationgeneralized assignment problemmaximal covering location problempublic sector location problems

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Cited in

(19)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3892037)