Pages that link to "Item:Q1838422"

The following pages link to Solving covering problems and the uncapacitated plant location problem on trees (Q1838422):

Displaying 28 items.

• Stability and fairness in models with a multiple membership (Q361803) (← links)
• Single-allocation ordered median hub location problems (Q709204) (← links)
• On the computational complexity of upper fractional domination (Q753848) (← links)
• The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation (Q864015) (← links)
• Approximately fair cost allocation in metric traveling salesman games (Q927408) (← links)
• A flexible model and efficient solution strategies for discrete location problems (Q1028444) (← links)
• A comparison of two dual-based procedures for solving the p-median problem (Q1058960) (← links)
• Location problems (Q1062596) (← links)
• Packing and covering a tree by subtrees (Q1101129) (← links)
• Totally balanced and totally unimodular matrices defined by center location problems (Q1104945) (← links)
• On a cost allocation problem arising from a capacitated concentrator covering problem (Q1316101) (← links)
• Solving the uncapacited plant location problem on trees (Q1327217) (← links)
• Structured \(p\)-facility location problems on the line solvable in polynomial time (Q1382805) (← links)
• Voluntary formation of communities for the provision of public projects. (Q1427494) (← links)
• Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs (Q1735675) (← links)
• The plant location problem with demand-dependent setup costs and centralized allocation (Q1806866) (← links)
• Traveling salesman games with the Monge property (Q1827808) (← links)
• Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games (Q2123122) (← links)
• A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem (Q2314413) (← links)
• An optimal algorithm for an outerplanar facility location problem with improved time complexity (Q2424182) (← links)
• Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation (Q2960364) (← links)
• LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES (Q3021975) (← links)
• On the connectedness property of service areas for the Network Facility Location Problem (Q3438964) (← links)
• Convexity in Graphs and Hypergraphs (Q3718757) (← links)
• A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices (Q3725872) (← links)
• Optimal algorithms for some inverse uncapacitated facility location problems on networks (Q5043849) (← links)
• Approximate core allocations for edge cover games (Q6122606) (← links)
• Approximate core allocations for edge cover games (Q6535804) (← links)