Pages that link to "Item:Q1121788"
From MaRDI portal
The following pages link to A Lagrangean approach to the degree-constrained minimum spanning tree problem (Q1121788):
Displaying 22 items.
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- A strong symmetric formulation for the min-degree constrained minimum spanning tree problem (Q325449) (← links)
- 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)
- A hop constrained min-sum arborescence with outage costs (Q875410) (← links)
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem (Q1025243) (← links)
- Minimal spanning trees with a constraint on the number of leaves (Q1291653) (← 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)
- Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm (Q1666108) (← links)
- A multiperiod degree constrained minimal spanning tree problem (Q1848629) (← links)
- Design of capacitated degree constrained min-sum arborescence (Q2085507) (← links)
- Degree-constrained \(k\)-minimum spanning tree problem (Q2221985) (← links)
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
- Using Lagrangian dual information to generate degree constrained spanning trees (Q2489896) (← links)
- DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH (Q2790350) (← links)
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (Q2914198) (← links)
- An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem (Q3479809) (← links)
- A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees (Q4360134) (← links)
- Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem (Q5228505) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585) (← links)
