Pages that link to "Item:Q709181"

The following pages link to MIP models for connected facility location: a theoretical and computational study (Q709181):

Displaying 26 items.

• Approximate robust optimization for the connected facility location problem (Q299099) (← links)
• Benders decomposition of the passive optical network design problem (Q325394) (← links)
• ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
• Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
• Lagrangian decompositions for the two-level FTTx network design problem (Q743641) (← links)
• Upgrading nodes in tree-shaped hub location (Q1628119) (← links)
• The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
• The connected facility location polytope (Q1686059) (← links)
• Fiber cable network design in tree networks (Q1749517) (← links)
• An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
• Outer approximation and submodular cuts for maximum capture facility location problems with random utilities (Q1754055) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Optimizing splitter and fiber location in a multilevel optical FTTH network (Q1926952) (← links)
• A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
• Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
• A two-level off-grid electric distribution problem on the continuous space (Q2147125) (← links)
• Heuristic and exact algorithms for minimum-weight non-spanning arborescences (Q2189916) (← links)
• A MIP-based approach to solve the prize-collecting local access network design problem (Q2256343) (← links)
• A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← 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)
• Branch‐and‐cut algorithms for the ‐arborescence star problem (Q6071060) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
• Configuration‐based approach for topological problems in the design of wireless sensor networks (Q6088118) (← links)
• New formulations for two location problems with interconnected facilities (Q6128897) (← links)