☆
4.7
Article
Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)
Rate this paper
The primary rating indicates the level of overall quality for the paper. Secondary ratings independently reflect strengths or weaknesses of the paper.
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationPublish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn More