Pages that link to "Item:Q1270784"

The following pages link to Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem (Q1270784):

Displaying 11 items.

• Improved algorithms for single machine scheduling with release dates and rejections (Q262445) (← links)
• Range minimization problems in path-facility location on trees (Q713326) (← links)
• Finding the conditional location of a median path on a tree (Q937298) (← links)
• Extensive facility location problems on networks with equity measures (Q1028434) (← links)
• The centdian subtree on tree networks (Q1602695) (← links)
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
• Extensive facility location problems on networks: an updated review (Q1667394) (← links)
• Revisiting \(k\)-sum optimization (Q1675256) (← links)
• Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
• Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
• The continuous and discrete path‐variance problems on trees (Q5191143) (← links)