Pages that link to "Item:Q3870691"

The following pages link to An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians (Q3870691):

Displaying 50 items.

• Efficient algorithms for the round-trip 1-center and 1-median problems (Q269488) (← links)
• Inverse 1-median problem on block graphs with variable vertex weights (Q283940) (← links)
• Orienting graphs to optimize reachability (Q290248) (← links)
• A reliable budget-constrained FL/ND problem with unreliable facilities (Q291688) (← links)
• The connected \(p\)-median problem on block graphs (Q315481) (← links)
• The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance (Q320084) (← links)
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (Q326486) (← links)
• The general facility location problem with connectivity on trees (Q335115) (← links)
• Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
• Demand point aggregation method for covering problems with gradual coverage (Q337550) (← links)
• \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis (Q337587) (← links)
• The backup 2-median problem on block graphs (Q403496) (← links)
• On the linear relaxation of the \(p\)-median problem (Q429694) (← links)
• Comparative error bound theory for three location models: continuous demand versus discrete demand (Q458944) (← links)
• The inverse 1-median problem on tree networks with variable real edge lengths (Q460433) (← links)
• Algorithms for location problems based on angular distances (Q471721) (← links)
• A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974) (← links)
• Data aggregation for \(p\)-median problems (Q491200) (← links)
• Inverse \(k\)-centrum problem on trees with variable vertex weights (Q494693) (← links)
• The location-dispatching problem: polyhedral results and content delivery network design (Q496706) (← links)
• Threshold robustness in discrete facility location problems: a bi-objective approach (Q499687) (← links)
• An effective heuristic for the \(P\)-median problem with application to ambulance location (Q505139) (← links)
• Sequential location of two facilities: comparing random to optimal location of the first facility (Q512975) (← links)
• A parallelized lagrangean relaxation approach for the discrete ordered median problem (Q512991) (← links)
• The pos/neg-weighted 2-medians in balanced trees with subtree-shaped customers (Q519220) (← links)
• Approximate solution of the \(p\)-median minimization problem (Q519693) (← links)
• Computing the center of uncertain points on tree networks (Q527423) (← links)
• Inverse \(p\)-median problems with variable edge lengths (Q532535) (← links)
• Spiders are status unique in trees (Q534035) (← links)
• A large class of facets for the \(K\)-median polytope (Q543406) (← links)
• Median problems with positive and negative weights on cycles and cacti (Q604872) (← links)
• The ordered capacitated facility location problem (Q611009) (← links)
• Prepositioning supplies in preparation for disasters (Q621705) (← links)
• Bee colony optimization for the \(p\)-center problem (Q632685) (← links)
• Optimizing server placement in distributed systems in the presence of competition (Q635301) (← links)
• Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
• Total distance, Wiener index and opportunity index in wreath products of star graphs (Q668076) (← links)
• Dynamic and static algorithms for optimal placement of resources in a tree (Q671529) (← links)
• On worst-case aggregation analysis for network location problems (Q689246) (← links)
• The heterogeneous \(p\)-median problem for categorization based clustering (Q692416) (← links)
• Multiobjective optimization for multimode transportation problems (Q721075) (← links)
• A continuous analysis framework for the solution of location-allocation problems with dense demand (Q733530) (← links)
• Confidence in heuristic solutions? (Q746822) (← links)
• The continuous center set of a network (Q757234) (← links)
• Improved complexity results for several multifacility location problems on trees (Q763099) (← links)
• The absolute centre of a graph (Q793644) (← links)
• Models for planning capacity expansion in local access telecommunication networks (Q806810) (← links)
• Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
• The stochastic location-assignment problem on a tree (Q816410) (← links)
• Heuristic procedures for solving the discrete ordered median problem (Q816415) (← links)