Solving covering problems and the uncapacitated plant location problem on trees
From MaRDI portal
Publication:1838422
DOI10.1016/0377-2217(83)90197-2zbMath0508.90035OpenAlexW2032534281MaRDI QIDQ1838422
Publication date: 1983
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(83)90197-2
location problemsdualitytree networktransformation procedureuncapacitated plant locationminimum cost coveringminimum cost operatingtotally-balanced matrix
Programming involving graphs or networks (90C35) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)
Related Items
Solving the uncapacited plant location problem on trees ⋮ Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games ⋮ Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ Convexity in Graphs and Hypergraphs ⋮ A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices ⋮ Packing and covering a tree by subtrees ⋮ Totally balanced and totally unimodular matrices defined by center location problems ⋮ The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation ⋮ Stability and fairness in models with a multiple membership ⋮ Structured \(p\)-facility location problems on the line solvable in polynomial time ⋮ An optimal algorithm for an outerplanar facility location problem with improved time complexity ⋮ Approximate core allocations for edge cover games ⋮ Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation ⋮ Voluntary formation of communities for the provision of public projects. ⋮ Approximately fair cost allocation in metric traveling salesman games ⋮ Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs ⋮ LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES ⋮ Single-allocation ordered median hub location problems ⋮ The plant location problem with demand-dependent setup costs and centralized allocation ⋮ On the computational complexity of upper fractional domination ⋮ A flexible model and efficient solution strategies for discrete location problems ⋮ A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem ⋮ Traveling salesman games with the Monge property ⋮ A comparison of two dual-based procedures for solving the p-median problem ⋮ Location problems ⋮ On the connectedness property of service areas for the Network Facility Location Problem ⋮ On a cost allocation problem arising from a capacitated concentrator covering problem
Cites Work
