Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
From MaRDI portal
Publication:2217463
Recommendations
Cites work
- A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
- A linear algorithm for a core of a tree
- A review of extensive facility location in networks
- Algorithms for a Core and k-Tree Core of a Tree
- Algorithms for path medi-centers of a tree
- An O(pn^ 2) algorithm for the p-median and related problems on tree graphs
- An exact completely positive programming formulation for the discrete ordered median problem: an extended version
- Conditional location of path and tree shaped facilities on trees
- Efficient algorithms for finding the (k,l)-core of tree networks
- Equity Maximizing Facility Location Schemes
- Equity measurement in facility location analysis: A review and framework
- Exact Solution of the Quadratic Knapsack Problem
- Extensive facility location problems on networks with equity measures
- Extensive facility location problems on networks: an updated review
- Fair dissections of spiders, worms, and caterpillars
- Fair optimization and networks: a survey
- Finding the \(\ell\)-core of a tree
- Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
- scientific article; zbMATH DE number 1091558 (Why is no real title available?)
- scientific article; zbMATH DE number 1947426 (Why is no real title available?)
- Improved algorithms for several network location problems with equality measures.
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
- Lifting valid inequalities for the precedence constrained knapsack problem
- Locating tree-shaped facilities using the ordered median objective
- Location analysis: a synthesis and survey
- Location theory. A unified approach
- Mean-Variance Location Problems
- On a tree-shaped facility location problem of Minieka
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- On locating path- or tree-shaped facilities on networks
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the product knapsack problem
- Optimum Locations on a Graph with Probabilistic Demands
- Polyhedral results for the precedence-constrained knapsack problem
- Primal-dual algorithms for precedence constrained covering problems
- Quadratic knapsack problems
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Technical Note—On the Complexity of Some Classes of Location Problems
- The bi‐criteria doubly weighted center‐median path problem on a tree
- The centdian subtree on tree networks
- The continuous and discrete path‐variance problems on trees
- The optimal location of a path or tree in a tree network
- The path-variance problem on tree networks
- The quadratic knapsack problem -- a survey
- The Sum Of Absolute Differences On A Network: Algorithm And Comparison With Other Equality Measures
This page was built for publication: Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2217463)
