Pages that link to "Item:Q1086497"
From MaRDI portal
The following pages link to Edge exchanges in the degree-constrained minimum spanning tree problem (Q1086497):
Displaying 21 items.
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (Q733522) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
- Edge exchanges in the degree-constrained minimum spanning tree problem (Q1086497) (← links)
- A Lagrangean approach to the degree-constrained minimum spanning tree problem (Q1121788) (← links)
- Variable neighborhood search for the degree-constrained minimum spanning tree problem (Q1348252) (← links)
- Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs. (Q1426688) (← links)
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems (Q1652284) (← links)
- Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm (Q1666108) (← links)
- A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem (Q1728477) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- A multiperiod degree constrained minimal spanning tree problem (Q1848629) (← links)
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints (Q1919978) (← links)
- Design of capacitated degree constrained min-sum arborescence (Q2085507) (← links)
- Using Lagrangian dual information to generate degree constrained spanning trees (Q2489896) (← links)
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (Q2914198) (← links)
- A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees (Q4360134) (← links)
- Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687) (← links)
- Network design for time‐constrained delivery (Q5503760) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
