Pages that link to "Item:Q1348252"
From MaRDI portal
The following pages link to Variable neighborhood search for the degree-constrained minimum spanning tree problem (Q1348252):
Displaying 26 items.
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- Optimal capacitated ring trees (Q286687) (← links)
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (Q339582) (← 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)
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem (Q932185) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm (Q972655) (← links)
- A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application (Q991831) (← links)
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem (Q1025243) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314) (← links)
- New genetic algorithm approach for the MIN-degree constrained minimum spanning tree (Q1751721) (← links)
- Design of capacitated degree constrained min-sum arborescence (Q2085507) (← links)
- Relations, models and a memetic approach for three degree-dependent spanning tree problems (Q2255965) (← links)
- Theoretical insights into the augmented-neural-network approach for combinatorial optimization (Q2271837) (← links)
- Using Lagrangian dual information to generate degree constrained spanning trees (Q2489896) (← links)
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← 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)
- Hybrid Metaheuristics: An Introduction (Q2950517) (← links)
- A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure (Q3025048) (← links)
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem (Q3163164) (← 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)
- Fixed parameter tractability of a biconnected bottleneck Steiner network problem (Q6066052) (← links)