Pages that link to "Item:Q4147891"

The following pages link to Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph (Q4147891):

Displaying 35 items.

• Comparative error bound theory for three location models: continuous demand versus discrete demand (Q458944) (← links)
• Maintaining centdians in a fully dynamic forest with top trees (Q479062) (← links)
• Algorithms for connected \(p\)-centdian problem on block graphs (Q724753) (← links)
• Multiple sink location problem in path networks with a combinational objective (Q828700) (← links)
• A polynomial algorithm for the multicriteria cent-dian location problem (Q864019) (← links)
• Algorithms for central-median paths with bounded length on trees (Q864041) (← links)
• The 2-radius and 2-radiian problems on trees (Q955029) (← links)
• Axiomatic considerations in multi-objective location theory (Q1107412) (← links)
• Group centre and group median of a network (Q1123113) (← links)
• A discretizing algorithm for location problems (Q1129969) (← links)
• A multicriteria approach to the location of public facilities (Q1138985) (← links)
• New perspectives in competitive location theory (Q1148211) (← links)
• Reducibility of minimax to minisum 0-1 programming problems (Q1148229) (← links)
• The obnoxious \(p\) facility network location problem with facility interaction (Q1291604) (← links)
• A geometrical solution for quadratic bicriteria location models (Q1296369) (← links)
• Inequality measures and equitable approaches to location problems (Q1582202) (← links)
• The centdian subtree on tree networks (Q1602695) (← links)
• A bi-objective approach to discrete cost-bottleneck location problems (Q1615950) (← links)
• Extensive facility location problems on networks: an updated review (Q1667394) (← links)
• Revisiting \(k\)-sum optimization (Q1675256) (← links)
• The probabilistic \(p\)-center problem: planning service for potential customers (Q1683071) (← links)
• Bridging \(k\)-sum and CVaR optimization in MILP (Q1722975) (← links)
• Minimizing the sum of the \(k\) largest functions in linear time. (Q1853685) (← links)
• An extended covering model for flexible discrete and equity location problems (Q2379187) (← links)
• Multiobjective analysis of facility location decisions (Q2638929) (← links)
• Using \(\ell^p\)-norms for fairness in combinatorial optimisation (Q2664297) (← links)
• A kernel search heuristic for a fair facility location problem (Q2668732) (← links)
• A linear time algorithm for connected \(p\)-centdian problem on block graphs (Q2672632) (← links)
• The Connected p-Centdian Problem on Block Graphs (Q3467867) (← links)
• (Q4526867) (← links)
• Worst-case incremental analysis for a class ofp-facility location problems (Q4537620) (← links)
• The generalized \(p\)-centdian on network (Q5937142) (← links)
• Approximability results for the $p$-centdian and the converse centdian problems (Q6045453) (← links)
• Unimodal eccentricity in trees (Q6087156) (← links)
• The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction (Q6159691) (← links)