Pages that link to "Item:Q5959396"
From MaRDI portal
The following pages link to The cable trench problem: Combining the shortest path and minimum spanning tree problems (Q5959396):
Displaying 8 items.
- The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
- A Benders decomposition based framework for solving cable trench problems (Q1652230) (← links)
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem (Q1762012) (← links)
- Modeling the capacitated \(p\)-cable trench problem with facility costs (Q2045638) (← links)
- An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
- Cost optimized design for the local wind turbine grid of an onshore wind farm (Q2675720) (← links)
- On the complexity of the cable-trench problem (Q6048437) (← links)
- Branch‐and‐cut algorithms for the ‐arborescence star problem (Q6071060) (← links)
