Modeling Facility Location Problems as Generalized Assignment Problems

DOI10.1287/mnsc.24.3.345zbMath0378.90066OpenAlexW2108219706MaRDI QIDQ4159171

G. Terry Ross, Richard M. Soland

Publication date: 1977

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

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10)

Related Items (41)

Some computational results on real 0-1 knapsack problems ⋮ A study of the bottleneck single source transportation problem ⋮ A quadratic integer program for the location of interacting hub facilities ⋮ Heuristics for the multi-resource generalized assignment problem ⋮ An algorithm for solving large capacitated warehouse location problems ⋮ A large-scale multilocation capacity planning model ⋮ Efficient primal-dual heuristic for a dynamic location problem ⋮ Multi-neighborhood local search optimization for machine reassignment problem ⋮ Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches ⋮ An improved direct descent algorithm for binary knapsack problems ⋮ Spectral projected subgradient with a momentum term for the Lagrangean dual approach ⋮ Lagrangian relaxation guided problem space search heuristics for generalized assignment problems ⋮ The bottleneck generalized assignment problem ⋮ A multicriteria approach to the location of public facilities ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ The equilibrium generalized assignment problem and genetic algorithm ⋮ The generalized assignment problem: Valid inequalities and facets ⋮ Effective algorithm and heuristic for the generalized assignment problem. ⋮ Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem ⋮ Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints ⋮ Locational analysis ⋮ Generalized cover facet inequalities for the generalized assignment problem ⋮ On a class of assignment problems. ⋮ Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem ⋮ Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs ⋮ Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach ⋮ A survey of algorithms for the generalized assignment problem ⋮ On the variable-depth-search heuristic for the linear-cost generalized assignment problem ⋮ A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes ⋮ Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships ⋮ Lagrangean heuristics for location problems ⋮ An algorithm for the bottleneck generalized assignment problem ⋮ Valid inequalities and facets of the capacitated plant location problem ⋮ Computational comparison on the partitioning strategies in multiple choice integer programming ⋮ Time-cost Trade-off Relations in Bulk Transportation Problem ⋮ A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems ⋮ A class of greedy algorithms for the generalized assignment problem ⋮ Capacity planning by the dynamic multi-resource generalized assignment problem (DMRGAP) ⋮ Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study ⋮ A multiplier adjustment technique for the capacitated concentrator location problem ⋮ Competitive strategies for an online generalized assignment problem with a service consecution constraint

This page was built for publication: Modeling Facility Location Problems as Generalized Assignment Problems