A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem

DOI10.1016/j.cor.2023.106248OpenAlexW4365511612MaRDI QIDQ6164630

Roberto Montemanni, Jafar Jamal, Mauro Dell'Amico

Publication date: 4 July 2023

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

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106248

zbMATH Keywords

Lagrangian relaxationbranch and boundmixed integer linear programmingnetwork optimizationprecedence constrained arborescences

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• A heuristic manipulation technique for the sequential ordering problem
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• An inexact algorithm for the sequential ordering problem
• On the choice of step size in subgradient optimization
• A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
• The \(p\)-arborescence star problem: formulations and exact solution approaches
• Minimum \(k\) arborescences with bandwidth constraints
• The capacitated minimum spanning tree problem: On improved multistar constraints
• An exact algorithm for the capacitated shortest spanning arborescence
• The weighted arborescence constraint
• An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers
• Algorithmic Aspects of the Maximum Colorful Arborescence Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• TSPLIB—A Traveling Salesman Problem Library
• A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
• A Randomly Weighted Minimum Arborescence with a Random Cost Constraint
• Optimum branchings
• Precedence-constrained arborescences

This page was built for publication: A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem