Pages that link to "Item:Q5690260"
From MaRDI portal
The following pages link to A Branch and Cut Algorithm for a Steiner Tree-Star Problem (Q5690260):
Displaying 15 items.
- Approximate robust optimization for the connected facility location problem (Q299099) (← 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)
- A branch-and-cut algorithm for the equicut problem (Q1373750) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- Branch-and-price approaches for the network design problem with relays (Q1651598) (← links)
- An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
- The General Steiner Tree-Star problem. (Q1853139) (← links)
- Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty (Q2084632) (← 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)
- A learning based algorithm for drone routing (Q2669632) (← links)
- A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract) (Q2958334) (← links)
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
- A branch-and-cut approach to solve the fault diagnosis problem with lazy spread and imperfect system information (Q6568395) (← links)
