Pages that link to "Item:Q662139"
From MaRDI portal
The following pages link to Branch-and-cut-and-price for capacitated connected facility location (Q662139):
Displayed 13 items.
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
- MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
- Lagrangian decompositions for the two-level FTTx network design problem (Q743641) (← links)
- The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
- The connected facility location polytope (Q1686059) (← links)
- An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
- Optimizing splitter and fiber location in a multilevel optical FTTH network (Q1926952) (← links)
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- A MIP-based approach to solve the prize-collecting local access network design problem (Q2256343) (← links)
- The incremental connected facility location problem (Q2329719) (← links)
- A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- Configuration‐based approach for topological problems in the design of wireless sensor networks (Q6088118) (← links)