Combined column-and-row-generation for the optimal communication spanning tree problem

DOI10.1016/j.cor.2018.01.003zbMath1391.90165OpenAlexW3124534414MaRDI QIDQ1652585

Christian Tilk, Stefan Irnich

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_1613.pdf

zbMATH Keywords

column generationnetworksrow generationbranch-and-price-and-cutoptimal communication spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)

Related Items (5)

Improved approaches to solve the one-to-one skewgram problem ⋮ The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm ⋮ Scheduling cleaning activities on trains by minimizing idle times ⋮ Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows ⋮ Solving the optimum communication spanning tree problem

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Lagrangean bounds for the optimum communication spanning tree problem
• Steiner's problem in graphs: Heuristic methods
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• Approximation algorithms for some optimum communication spanning tree problems
• General network design: a unified view of combined location and network design problems
• Algorithms for the optimum communication spanning tree problem
• Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
• Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
• Optimum Communication Spanning Trees
• Constrained Optimum Communication Trees and Sensitivity Analysis
• Trees and Cuts
• The complexity of the network design problem
• Exact algorithms for minimum routing cost trees
• A Column Generation Approach for Large-Scale Aircrew Rostering Problems
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• On Optimal Solutions for the Optimal Communication Spanning Tree Problem
• Column Generation
• Selected Topics in Column Generation

This page was built for publication: Combined column-and-row-generation for the optimal communication spanning tree problem