The following pages link to (Q3971521):
Displaying 38 items.
- Efficient algorithms for the round-trip 1-center and 1-median problems (Q269488) (← links)
- Covering part of a planar network (Q291695) (← links)
- On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689) (← links)
- Comparative error bound theory for three location models: continuous demand versus discrete demand (Q458944) (← links)
- The maximin gradual cover location problem (Q480773) (← links)
- An iterated local search for the budget constrained generalized maximal covering location problem (Q483216) (← links)
- Competitive location in the plane (Q689241) (← links)
- Dominating set games. (Q703283) (← links)
- On the core of network synthesis games (Q757264) (← links)
- The nestedness property of the convex ordered median location problem on a tree (Q783030) (← links)
- An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure (Q816402) (← links)
- Polyhedral properties of the \(K\)-median problem on a tree (Q879965) (← links)
- Location coverage models with demand originating from nodes and paths: Application to cellular network design (Q928021) (← links)
- Covering a line segment with variable radius discs (Q960389) (← links)
- Generalized coverage: new developments in covering location models (Q976025) (← links)
- Center location problems on tree graphs with subtree-shaped customers (Q1005232) (← links)
- Improved algorithms for the multicut and multiflow problems in rooted trees (Q1024699) (← links)
- Aggregation error for location models: Survey and analysis (Q1026594) (← links)
- Totally balanced and totally unimodular matrices defined by center location problems (Q1104945) (← links)
- Improved complexity bounds for location problems on the real line (Q1180820) (← links)
- Locating flow-capturing units on a network with multi-counting and diminishing returns to scale (Q1278239) (← links)
- A unifying location model on tree graphs based on submodularity property (Q1314341) (← links)
- On some optimization problems on \(k\)-trees and partial \(k\)-trees (Q1315461) (← links)
- On a cost allocation problem arising from a capacitated concentrator covering problem (Q1316101) (← links)
- Integer programming formulations of discrete hub location problems (Q1317166) (← links)
- The least element property of center location on tree networks with applications to distance and precedence constrained problems (Q1319019) (← links)
- The gradual covering decay location problem on a network. (Q1410306) (← links)
- Voluntary formation of communities for the provision of public projects. (Q1427494) (← links)
- Benders-and-cut algorithm for fixed-charge capacitated network design problem (Q1582048) (← links)
- Traveling salesman games with the Monge property (Q1827808) (← links)
- A framework for demand point and solution space aggregation analysis for location models (Q1887955) (← links)
- Reliability, covering and balanced matrices (Q1892656) (← links)
- Online clustering with variable sized clusters (Q1939661) (← links)
- On a class of covering problems with variable capacities in wireless networks (Q2339450) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices (Q3725872) (← links)
- Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs (Q3754451) (← links)
- The generalized maximal covering location problem (Q5959382) (← links)
