Pages that link to "Item:Q1919972"
From MaRDI portal
The following pages link to Facility location on a tree with maximum distance constraints (Q1919972):
Displaying 17 items.
- The general facility location problem with connectivity on trees (Q335115) (← links)
- A distribution network design problem in the automotive industry: MIP formulation and heuristics (Q337173) (← links)
- An efficient algorithm to solve the conditional covering problem on trapezoid graphs (Q410643) (← links)
- On conditional covering problem (Q626967) (← links)
- Efficient algorithms for the conditional covering problem (Q690494) (← links)
- A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (Q830937) (← links)
- Facility location and the geometric minimum-diameter spanning tree. (Q1421033) (← links)
- The conditional covering problem on unweighted interval graphs with nonuniform coverage radius (Q1948610) (← links)
- Covering problem on fuzzy graphs and its application in disaster management system (Q2157042) (← links)
- Locating Two Facilities on a Tree Subject to Distance Constraints (Q3796939) (← links)
- (Q3813624) (← links)
- Distance-constrained multifacility minimax location problems on tree networks (Q3989543) (← links)
- Technical Note—A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree (Q4365000) (← links)
- MULTI-FACILITY LOCATION PROBLEM WITH NONINCREASING PIECEWISE LINEAR DEMAND ON A TREE (Q4538185) (← links)
- (Q5009599) (← links)
- A new method for solving capacitated location problems based on a set partitioning approach (Q5959081) (← links)
- Bilevel optimization for the deployment of refuelling stations for electric vehicles on road networks (Q6551058) (← links)