Looking for edge-equitable spanning trees

DOI10.1016/J.COR.2013.07.023MaRDI QIDQ336753zbMATH OpenOpenAlexFDO

Authors Mercedes Landete, Alfredo Marín

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2013.07.023

zbMATH Keywords

integer programmingspanning treeordered median function

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Integer programming (90C10)

Recommendations

• Balanced spanning forests and trees
• Ordered weighted average optimization in multiobjective spanning tree problem
• Exact algorithms for OWA-optimization in multiobjective spanning tree problems
• The problem of the optimal biobjective spanning tree
• The color-balanced spanning tree problem.

Cites work

• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• A flexible model and efficient solution strategies for discrete location problems
• Combinatorial optimization. Networks and matroids
• Equity measurement in facility location analysis: A review and framework
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Integer Programming Formulation of Traveling Salesman Problems
• Integer Programming Formulations for the k-Cardinality Tree Problem
• Lagrangean bounds for the optimum communication spanning tree problem
• On the generalized minimum spanning tree problem
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Steiner tree problems
• Tight bounds from a path based formulation for the tree of hub location problem

Cited in

(12)

• Median and covering location problems with interconnected facilities
• A branch-and-price procedure for clustering data that are graph connected
• Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
• Inverse and reverse balanced facility location problems with variable edge lengths on trees
• Clustering data that are graph connected
• Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
• Inverse single facility location problem on a tree with balancing on the distance of server to clients
• Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
• scientific article; zbMATH DE number 7709522 (Why is no real title available?)
• Advanced network connectivity features and zonal requirements in covering location problems
• The profit-oriented hub line location problem with elastic demand
• Ordered weighted average optimization in multiobjective spanning tree problem

This page was built for publication: Looking for edge-equitable spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336753)