Heuristics for the central tree problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3726241 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1498519 (Why is no real title available?)
- scientific article; zbMATH DE number 804636 (Why is no real title available?)
- A Benders decomposition approach for the robust spanning tree problem with interval data
- A branch and bound algorithm for the robust spanning tree problem with interval data
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- Interval data minmax regret network optimization problems
- On the Problem of Decomposing a Graph into n Connected Factors
- On the complexity of the robust spanning tree problem with interval data
- Robust discrete optimization and its applications
- Simulated annealing algorithm for the robust spanning tree problem
- The robust spanning tree problem with interval data
This page was built for publication: Heuristics for the central tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707727)