Design of capacitated degree constrained min-sum arborescence
From MaRDI portal
Publication:2085507
DOI10.1007/s12597-022-00575-3OpenAlexW4298193013MaRDI QIDQ2085507
Publication date: 18 October 2022
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-022-00575-3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge exchanges in the degree-constrained minimum spanning tree problem
- A Lagrangean approach to the degree-constrained minimum spanning tree problem
- The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- Using Lagrangian dual information to generate degree constrained spanning trees
- A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
- Savings based ant colony optimization for the capacitated minimum spanning tree problem
- A branch and cut method for the degree-constrained minimum spanning tree problem
- Centralized teleprocessing network design
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- Heuristics with Constant Error Guarantees for the Design of Tree Networks
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Topological design of centralized computer networks—formulations and algorithms
- Computing capacitated minimal spanning trees efficiently
- A good algorithm for smallest spanning trees with a degree constraint
- The Held—Karp algorithm and degree-constrained minimum 1-trees
- The complexity of the capacitated tree problem
- An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
- A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- Validation of subgradient optimization
- The Capacitated Minimum Spanning Tree
- Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
This page was built for publication: Design of capacitated degree constrained min-sum arborescence
