Pages that link to "Item:Q2892148"
From MaRDI portal
The following pages link to Exact approaches to the single-source network loading problem (Q2892148):
Displaying 15 items.
- Lagrangian decompositions for the two-level FTTx network design problem (Q743641) (← links)
- From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints (Q1662655) (← links)
- Benders decomposition for very large scale partial set covering and maximal covering location problems (Q1719620) (← links)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
- Optimizing splitter and fiber location in a multilevel optical FTTH network (Q1926952) (← links)
- Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule (Q2030506) (← links)
- A MIP-based approach to solve the prize-collecting local access network design problem (Q2256343) (← links)
- A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- A partitioning algorithm for the network loading problem (Q2654332) (← links)
- Benders decomposition for network design covering problems (Q2669611) (← links)
- Two-criteria problem of distribution of external load for a network with periodic rate of the input flow (Q2850424) (← links)
- Exact Approaches for Designing Multifacility Buy-at-Bulk Networks (Q5131690) (← links)
- An exact approach for the multicommodity network optimization problem with a step cost function (Q5244303) (← links)
- Efficient presolving methods for the influence maximization problem (Q6139380) (← links)
