Looking for edge-equitable spanning trees
DOI10.1016/J.COR.2013.07.023zbMATH Open1348.90600OpenAlexW2033011096MaRDI QIDQ336753FDOQ336753
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
Recommendations
Programming involving graphs or networks (90C35) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Integer programming (90C10)
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Integer Programming Formulation of Traveling Salesman Problems
- Title not available (Why is that?)
- On the generalized minimum spanning tree problem
- Steiner tree problems
- Tight bounds from a path based formulation for the tree of hub location problem
- Equity measurement in facility location analysis: A review and framework
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- A flexible model and efficient solution strategies for discrete location problems
- Combinatorial optimization. Networks and matroids
- Integer Programming Formulations for the k-Cardinality Tree Problem
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- Lagrangean bounds for the optimum communication spanning tree problem
Cited In (12)
- 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
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
- A branch-and-price procedure for clustering data that are graph connected
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
- Clustering data that are graph connected
- Inverse single facility location problem on a tree with balancing on the distance of server to clients
- Title not available (Why is that?)
- Median and covering location problems with interconnected facilities
- 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
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)
