Extended formulations for the cardinality constrained subtree of a tree problem

Authors:
A. Agra;L. Gouveia;C. Requejo
Affiliations:
DMat and CEOC, University of Aveiro, Campus Universitário de Santiago 3810-193 Aveiro, Portugal;DEIO and CIO, Faculdade de Ciências, Universidade de Lisboa, Campo Grande, Edifício C6 - 4 piso, 1749-016 Lisboa, Portugal;DMat and CEOC, University of Aveiro, Campus Universitário de Santiago 3810-193 Aveiro, Portugal
Venue:
Operations Research Letters
Year:
2009

Citing 4
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
Optimizing constrained subtrees of trees

Mathematical Programming: Series A and B
Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints

INFORMS Journal on Computing
Reformulation by discretization: Application to economic lot sizing

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a tree with n nodes, we consider the problem of finding the most profitable subtree of that tree with at most K nodes which is known as the Cardinality Subtree of a Tree Problem. We present a new exact linear extended formulation with O(nK) two-indexed variables and O(nK) constraints.