An Algorithmic Approach to Network Location Problems. II: Thep-Medians

Cited in

(only showing first 100 items - show all)

Center location problems on tree graphs with subtree-shaped customers
Efficient algorithms for two generalized 2-median problems and the group median problem on trees
A polynomial method for the pos/neg weighted 3-median problem on a tree
A computational evaluation of a general branch-and-price framework for capacitated network location problems
Optimal location with equitable loads
Up- and downgrading the 1-center in a network
A flexible model and efficient solution strategies for discrete location problems
Joint object placement and node dimensioning for internet content distribution
Worst-case analysis of demand point aggregation for the Euclidean p-median problem
Distribution systems design with role dependent objectives
Networks with Condorcet solutions
A comparison of two dual-based procedures for solving the p-median problem
Combinatorial analysis (nonnegative matrices, algorithmic problems)
Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree
Efficient implementation of a shifting algorithm
Finding the two-core of a tree
The distance-domination numbers of trees
On locating new facilities in a competitive environment
Locational analysis
Approximation algorithms for minimum tree partition
Heuristic solution of the multisource Weber problem as a \(p\)-median problem
An efficient tabu search procedure for the p-median problem
Partial and perfect path covers of cographs
Some new algorithms for location problems on networks
Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
A theory for memory-based learning
Finding the \(\ell\)-core of a tree
Location and layout planning. A survey
A maximum b-matching problem arising from median location models with applications to the roommates problem
A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
Optimal algorithms for generalized searching in sorted matrices
Budget constrained location problem with opening and closing of facilities.
Sorting weighted distances with applications to objective function evaluations in single facility location problems.
Product location, allocation and server home base location for an order picking line with multiple servers.
2-medians in trees with pos/neg weights
An algorithm for finding a k-median in a directed tree
The connected \(p\)-center problem on cactus graphs
The w-centroids and least w-central subtrees in weighted trees
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
Making a state-of-the-art heuristic faster with data mining
Trees with unique least central subtrees
A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
A survey of healthcare facility location
A new approach to cooperative competition in facility location problems: mathematical formulations and an approximation algorithm
An improved algorithm for the minmax regret path centdian problem on trees
The multi-service center problem
A hybrid artificial bee colony algorithm for the p-median problem with positive/negative weights
On discrete preferences and coordination
Synthetic optimization model and algorithm for railway freight center station location and wagon flow organization problem
The inverse 1-center problem on cycles with variable edge lengths
Finding an optimal core on a tree network with M/G/c/c state-dependent queues
Location routing problems on trees
A mathematical model for fuzzy \(p\)-median problem with fuzzy weights and variables
The stochastic queue core problem, evacuation networks, and state-dependent queues
A computational study of a nonlinear minsum facility location problem
Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
An aggregation heuristic for large scale p-median problem
Location analysis: a synthesis and survey
Group centre and group median of a tree
The plant location problem with demand-dependent setup costs and centralized allocation
A constant-factor approximation algorithm for the k-median problem
Clustering to minimize the sum of cluster diameters
Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
Some heuristic methods for solving p-median problems with a coverage constraint
Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
Minimum statuses of connected graphs with fixed maximum degree and order
Finding a core of a tree with pos/neg weight
Does Euclidean distance work well when the \(p\)-median model is applied in rural areas?
On the tree conjecture for the network creation game
Classical and inverse median location problems under uncertain environment
Location of facility based on simulated annealing and ``ZKW algorithms
A multi-product production/distribution system design problem with direct shipments and lateral transshipments
Inverse group 1-median problem on trees
Near-optimal large-scale k-medoids clustering
A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering
The traveling \(k\)-median problem: approximating optimal network coverage
Problem-based optimal scenario generation and reduction in stochastic programming
Scenario reduction revisited: fundamental limits and guarantees
Efficient algorithms for the minmax regret path center problem with length constraint on trees
Minimum status of series-reduced trees with given parameters
An improved \((1+1)\) evolutionary algorithm for \(k\)-Median clustering problem with performance guarantee
A voltage drop limited decentralized electric power distribution network
Constant work-space algorithms for facility location problems
An improved algorithm for the minmax regret path center problem on trees
Computational aspects of the inverse single facility location problem on trees under l_k-norm
Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem
Convex fuzzy \(k\)-medoids clustering
An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
A modified variable neighborhood search for the discrete ordered median problem
The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
Minsum \(k\)-sink problem on path networks
Solving multiple facilities location problems with separated clusters
Clustering and portfolio selection problems: a unified framework
A combinatorial algorithm for the ordered 1-median problem on cactus graphs
Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
On cutting planes for cardinality-constrained linear programs
Weighted cache location problem with identical servers
A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem
Distance measure and the p-median problem in rural areas
On the minmax regret path median problem on trees

This page was built for publication: An Algorithmic Approach to Network Location Problems. II: Thep-Medians

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