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):
Displayed 14 items.
- 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)
- 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)
- 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)
- An ant colony optimisation algorithm for scheduling in agile manufacturing (Q3533169) (← links)
- Randomized heuristics for the Max-Cut problem (Q4405937) (← links)
- Network design for time‐constrained delivery (Q5503760) (← links)