An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees


In a previous paper, using underlying graph theoretical properties, Gouveia and Magnanti (2003) described several network flow-based formulations for diameter-constrained tree problems. Their computational results showed that, even with several enhancements, models for situations when the tree diameter D is odd proved to be more difficult to solve than… (More)
DOI: 10.1007/s10479-006-0049-0


2 Figures and Tables

Slides referencing similar topics