Solving covering problems and the uncapacitated plant location problem on trees

duality location problems tree network transformation procedure uncapacitated plant location minimum cost covering minimum cost operating totally-balanced matrix

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)

Cites Work

Totally-Balanced and Greedy Matrices
A Dual-Based Procedure for Uncapacitated Facility Location
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)

Cited In (28)

Stability and fairness in models with a multiple membership
Location problems
The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation
Packing and covering a tree by subtrees
Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games
Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
On the computational complexity of upper fractional domination
Traveling salesman games with the Monge property
A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
Structured \(p\)-facility location problems on the line solvable in polynomial time
Single-allocation ordered median hub location problems
LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES
On the connectedness property of service areas for the Network Facility Location Problem
Voluntary formation of communities for the provision of public projects.
The plant location problem with demand-dependent setup costs and centralized allocation
On a cost allocation problem arising from a capacitated concentrator covering problem
Totally balanced and totally unimodular matrices defined by center location problems
Solving the uncapacited plant location problem on trees
Optimal algorithms for some inverse uncapacitated facility location problems on networks
A flexible model and efficient solution strategies for discrete location problems
A comparison of two dual-based procedures for solving the p-median problem
Convexity in Graphs and Hypergraphs
Approximately fair cost allocation in metric traveling salesman games
A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
Approximate core allocations for edge cover games
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

This page was built for publication: Solving covering problems and the uncapacitated plant location problem on trees

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