Extensive facility location problems on networks: an updated review (Q1667394): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 01:59, 11 December 2024

scientific article

Language	Label	Description	Also known as
English	Extensive facility location problems on networks: an updated review	scientific article

Statements

scholarly article

0 references

Extensive facility location problems on networks: an updated review (English)

0 references

0 references

0 references

Andrea Scozzari

0 references

0 references

publication date

28 August 2018

0 references

zbMATH Keywords

path location problems

0 references

tree location problems

0 references

ordered median

0 references

equity measures

0 references

minimum loss criteria

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11750-018-0476-5

0 references

Maintaining information in fully dynamic trees with top trees

0 references

On the minmax regret path median problem on trees

0 references

Algorithms for path medi-centers of a tree

0 references

Core and Conditional Core Path of Specified Length in Special Classes of Graphs

0 references

Finding the two-core of a tree

0 references

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

0 references

Finding the \(\ell\)-core of a tree

0 references

Algorithms for central-median paths with bounded length on trees

0 references

The location of median paths on grid graphs

0 references

Collection depots facility location problems in trees

0 references

Optimal algorithms for the path/tree-shaped facility location problems in trees

0 references

Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees

0 references

Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees

0 references

Efficient solution methods for covering tree problems

0 references

The path-variance problem on tree networks

0 references

Continuous location of dimensional structures.

0 references

Linear-time computability of combinatorial problems on series-parallel graphs

0 references

Finding kth paths and p-centers by generating and searching good data structures

0 references

Bi-objective median subtree location problems

0 references

On locating path- or tree-shaped facilities on networks

0 references

Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph

0 references

Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs

0 references

Hamilton Paths in Grid Graphs

0 references

Multifacility ordered median problems on networks: A further analysis

0 references

0 references

Locating median cycles in networks

0 references

Locating a cycle in a transportation or a telecommunications network

0 references

Location Science

0 references

Comparing different metaheuristic approaches for the median path problem with bounded length

0 references

Locating median paths on connected outerplanar graphs

0 references

Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems

0 references

A review of extensive facility location in networks

0 references

Improved algorithms for several network location problems with equality measures.

0 references

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

0 references

A linear algorithm for a core of a tree

0 references

0 references

Location Theory

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

Locating tree-shaped facilities using the ordered median objective

0 references

The bi‐criteria doubly weighted center‐median path problem on a tree

0 references

Extensive facility location problems on networks with equity measures

0 references

The continuous and discrete path‐variance problems on trees

0 references

Minimax regret path location on trees

0 references

Range minimization problems in path-facility location on trees

0 references

Reliability problems in multiple path-shaped facility location on networks

0 references

Revisiting \(k\)-sum optimization

0 references

Optimal location of a path or tree on a network with cycles

0 references

The nestedness property of location problems on the line

0 references

0 references

A Linear Time Algorithm for Finding ak-Tree Core

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

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

Conditional location of path and tree shaped facilities on trees

0 references

A note on the subtree ordered median problem in networks based on nestedness property

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

Efficient algorithms for a constrained k-tree core problem in a tree network

0 references

Finding the conditional location of a median path on a tree

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1007/S11750-018-0476-5

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1667394

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