Locating tree-shaped facilities using the ordered median objective (Q1771313)

From MaRDI portal

Revision as of 10:13, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Locating tree-shaped facilities using the ordered median objective	scientific article

Statements

scholarly article

0 references

Locating tree-shaped facilities using the ordered median objective (English)

0 references

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

19 April 2005

0 references

zbMATH Keywords

tree network

0 references

linear programming

0 references

dynamic programming

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10107-004-0547-2

0 references

Finding the two-core of a tree

0 references

Efficient algorithms for finding the (k,l)-core of tree networks

0 references

A review of extensive facility location in networks

0 references

0 references

A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem

0 references

Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints

0 references

Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure

0 references

Aggregation Error Bounds for a Class of Location Models

0 references

Worst-case incremental analysis for a class ofp-facility location problems

0 references

On locating path- or tree-shaped facilities on networks

0 references

On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees

0 references

Multifacility ordered median problems on networks: A further analysis

0 references

Algorithmic results for ordered median problems

0 references

0 references

0 references

The optimal location of a path or tree in a tree network

0 references

On finding the core of a tree with a specified length

0 references

A linear algorithm for a core of a tree

0 references

0 references

Minimizing the sum of the \(k\) largest functions in linear time.

0 references

Efficient Algorithms for Finding a Core of a Tree with a Specified Length

0 references

Algorithms for a Core and k-Tree Core of a Tree

0 references

Minimizing symmetric submodular functions

0 references

A flexible approach to location problems

0 references

0 references

A unifying location model on tree graphs based on submodularity property

0 references

An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs

0 references

Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem

0 references

The \(k\)-centrum multi-facility location problem

0 references

Sorting weighted distances with applications to objective function evaluations in single facility location problems.

0 references

The generalized <i>P</i>‐forest problem on a tree network

0 references

The centdian subtree on tree networks

0 references

A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs

0 references

An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations

0 references

Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network

0 references

Finding a 2-Core of a Tree in Linear Time

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1007/S10107-004-0547-2

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1771313

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1771313&oldid=38740585"