Pages that link to "Item:Q2899090"

The following pages link to Dual-based local search for the connected facility location and related problems (Q2899090):

Displaying 19 items.

• Approximate robust optimization for the connected facility location problem (Q299099) (← links)
• Models and algorithms for network reduction (Q320811) (← links)
• Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
• MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
• The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
• The connected facility location polytope (Q1686059) (← links)
• An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
• Primal-dual algorithms for connected facility location problems (Q1884770) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
• The incremental connected facility location problem (Q2329719) (← links)
• A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
• A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract) (Q2958334) (← links)
• (Q4411292) (← links)
• Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (Q5131721) (← links)
• Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
• New formulations for two location problems with interconnected facilities (Q6128897) (← links)