Pages that link to "Item:Q3870690"

The following pages link to An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers (Q3870690):

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)
• Bounded fan-out \(m\)-center problem (Q287146) (← links)
• The \(p\)-neighbor \(k\)-center problem (Q293209) (← links)
• An efficient algorithm for the length-constrained heaviest path problem on a tree (Q294615) (← links)
• Kinetic clustering of points on the line (Q301594) (← links)
• Inverse eccentric vertex problem on networks (Q301951) (← links)
• Capacitated \(p\)-center problem with failure foresight (Q319964) (← links)
• The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance (Q320084) (← links)
• Continuous multifacility ordered median location problems (Q322399) (← links)
• Robust vertex \(p\)-center model for locating urgent relief distribution centers (Q336453) (← links)
• Double bound method for solving the \(p\)-center location problem (Q336682) (← links)
• Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent (Q337640) (← links)
• When centers can fail: a close second opportunity (Q337641) (← links)
• Representation of the non-dominated set in biobjective discrete optimization (Q342058) (← links)
• Bounded-degree minimum-radius spanning trees in wireless sensor networks (Q391199) (← links)
• The connected \(p\)-center problem on block graphs with forbidden vertices (Q418726) (← links)
• Backup 2-center on interval graphs (Q442280) (← links)
• The maximin gradual cover location problem (Q480773) (← links)
• Algorithms for the minimum diameter terminal Steiner tree problem (Q489734) (← links)
• Inverse \(k\)-centrum problem on trees with variable vertex weights (Q494693) (← links)
• Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
• Sequential location of two facilities: comparing random to optimal location of the first facility (Q512975) (← links)
• An optimal algorithm for the weighted backup 2-center problem on a tree (Q513273) (← links)
• Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
• Total distance, Wiener index and opportunity index in wreath products of star graphs (Q668076) (← links)
• On the minimum diameter spanning tree problem (Q673823) (← links)
• On worst-case aggregation analysis for network location problems (Q689246) (← links)
• The minimum weight \(t\)-composition of an integer (Q690540) (← links)
• Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (Q693145) (← links)
• Orthogonal segment stabbing (Q705557) (← links)
• On weighted rectilinear 2-center and 3-center problems (Q757236) (← links)
• A simple heuristic for the p-centre problem (Q761233) (← links)
• Improved complexity results for several multifacility location problems on trees (Q763099) (← links)
• Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
• The absolute centre of a graph (Q793644) (← links)
• Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
• Enhancements to two exact algorithms for solving the vertex \(P\)-center problem (Q814956) (← links)
• Demand point aggregation for planar covering location models (Q816417) (← links)
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (Q830937) (← links)
• Finding a longest nonnegative path in a constant degree tree (Q835050) (← links)
• The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527) (← links)
• An \(O(mn)\) algorithm for the anti-cent-dian problem (Q864778) (← links)
• An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths (Q868984) (← links)
• Two paths location of a tree with positive or negative weights (Q896109) (← links)
• The absolute center of a unicyclic network (Q908837) (← links)
• The discrete p-dispersion problem (Q915643) (← links)
• Combinatorial network abstraction by trees and distances (Q954979) (← links)
• The 2-radius and 2-radiian problems on trees (Q955029) (← links)
• A reactive GRASP for a commercial territory design problem with multiple balancing requirements (Q955609) (← links)