Pages that link to "Item:Q4162931"

The following pages link to The Centers and Medians of a Graph (Q4162931):

Displaying 17 items.

• The minisum location problem on an undirected network with continuous link demands (Q580156) (← links)
• The gravity multiple server location problem (Q609819) (← links)
• Bee colony optimization for the \(p\)-center problem (Q632685) (← links)
• On the minimum diameter spanning tree problem (Q673823) (← links)
• The continuous center set of a network (Q757234) (← links)
• The absolute centre of a graph (Q793644) (← links)
• Pendant-medians (Q1055337) (← links)
• Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree (Q1067987) (← links)
• Distance center and centroid of a median graph (Q1092069) (← links)
• A heuristic for the p-center problem in graphs (Q1098862) (← links)
• Group centre and group median of a network (Q1123113) (← links)
• The Weber obnoxious facility location model: a big arc small arc approach (Q1651661) (← links)
• Group centre and group median of a tree (Q1804070) (← links)
• Capacitated, balanced, sequential location-allocation problems on chains and trees (Q2638927) (← links)
• Big segment small segment global optimization algorithm on networks (Q3113501) (← links)
• On the computational complexity of centers locating in a graph (Q3902477) (← links)
• Covering edges in networks (Q6087399) (← links)