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