An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
From MaRDI portal
Publication:3671755
DOI10.2307/2581020zbMath0521.90075OpenAlexW4235091162MaRDI QIDQ3671755
No author found.
Publication date: 1983
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2581020
computational experienceset partitioningcolumn-generating branch and bound procedurefixed-charge assignment problemsources with known capacitiesusers with known demands
Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Boolean programming (90C09)
Related Items
Modelling location and sizing of offshore platforms, A Lagrangian heuristic for the capacitated plant location problem with single source constraints, Efficient algorithms for the capacitated concentrator location problem, Cluster analysis and mathematical programming, A branch-and-price algorithm for the capacitated facility location problem, An exact algorithm for the capacitated facility location problems with single sourcing, A cut-and-solve based algorithm for the single-source capacitated facility location problem, A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem, Locating Satellite Yards in Forestry Operations, Resource-Constrained Assignment Problems with Shared Resource Consumption and Flexible Demand, Upper and lower bounds for the single source capacitated location problem., A tree search algorithm for the p-median problem, Approximate solutions to large scale capacitated facility location problems, Scatter search for the single source capacitated facility location problem, Lower and upper bounds for a two-level hierarchical location problem in computer networks, An improved cut-and-solve algorithm for the single-source capacitated facility location problem, A dual RAMP algorithm for single source capacitated facility location problems, Minimization of makespan in generalized assignment problem., The \(K\)-coverage concentrator location problem, Location and sizing of offshore platforms for oil exploration, Locating concentrators in centralized computer networks, The vendor location problem, Planning and coordination of production and distribution facilities for multiple commodities, Benders decomposition, Lagrangean relaxation and metaheuristic design, A new method for solving capacitated location problems based on a set partitioning approach, Lagrangean heuristics for location problems, An algorithm for the bottleneck generalized assignment problem, Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type, Auxiliary tool allocation in flexible manufacturing systems, A computational evaluation of a general branch-and-price framework for capacitated network location problems, An exact method for the two-echelon, single-source, capacitated facility location problem, An extension of the \(p\)-median group technology algorithm, Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem, A repeated matching heuristic for the single-source capacitated facility location problem
