Looking for edge-equitable spanning trees

DOI10.1016/j.cor.2013.07.023zbMath1348.90600OpenAlexW2033011096MaRDI QIDQ336753

Alfredo Marín, Mercedes Landete

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) Integer programming (90C10) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (12)

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

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Lagrangean bounds for the optimum communication spanning tree problem
• Tight bounds from a path based formulation for the tree of hub location problem
• A flexible model and efficient solution strategies for discrete location problems
• Equity measurement in facility location analysis: A review and framework
• 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
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• On the generalized minimum spanning tree problem
• Steiner tree problems

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