Pages that link to "Item:Q4537623"
From MaRDI portal
The following pages link to Exact algorithms for minimum routing cost trees (Q4537623):
Displayed 21 items.
- Models and algorithms for network reduction (Q320811) (← links)
- Lagrangean bounds for the optimum communication spanning tree problem (Q611003) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Designing a road network for hazardous materials shipments (Q853892) (← links)
- On the intercluster distance of a tree metric (Q861256) (← links)
- On the minimum average distance spanning tree of the hypercube (Q934836) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- Compact vs. exponential-size LP relaxations (Q1612003) (← links)
- Combined column-and-row-generation for the optimal communication spanning tree problem (Q1652585) (← links)
- Mathematical programming in computational biology: an annotated bibliography (Q1662439) (← links)
- An integer linear programming formulation for the minimum cardinality segmentation problem (Q1736729) (← links)
- Approximation algorithms for the optimal \(p\)-source communication spanning tree (Q1887037) (← links)
- Solving the optimum communication spanning tree problem (Q1991267) (← links)
- Special issue on: Optimization methods for decision making: advances and applications (Q2317617) (← links)
- The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm (Q2317621) (← links)
- On the minimum routing cost clustered tree problem (Q2359809) (← links)
- The Balanced Minimum Evolution Problem (Q2815445) (← links)
- Integer Linear Programming in Computational Biology (Q3644723) (← links)
- Optimization in telecommunication networks (Q5313481) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)