Extended formulations for the cardinality constrained subtree of a tree problem

DOI10.1016/j.orl.2009.02.002zbMath1167.90659OpenAlexW2066405186WikidataQ57736598 ScholiaQ57736598MaRDI QIDQ833578

Agostinho Agra, Luís Gouveia, Cristina Requejo

Publication date: 14 August 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2009.02.002

zbMATH Keywords

extended formulationscardinality constraintordering variablessubtree of a tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

The minimal number of subtrees with a given degree sequence

Cites Work

• Unnamed Item
• Unnamed Item
• Optimizing constrained subtrees of trees
• Reformulation by discretization: application to economic lot sizing
• Tree knapsack approaches for local access network design
• A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees

This page was built for publication: Extended formulations for the cardinality constrained subtree of a tree problem