The k-Cardinality Tree Problem: reformulations and Lagrangian relaxation
From MaRDI portal
Publication:987675
Recommendations
- New branch-and-bound algorithms for \(k\)-cardinality tree problems
- Integer Programming Formulations for the k-Cardinality Tree Problem
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
- scientific article; zbMATH DE number 1195632
- Weighted k‐cardinality trees: Complexity and polyhedral structure
Cites work
- scientific article; zbMATH DE number 4010182 (Why is no real title available?)
- scientific article; zbMATH DE number 3529629 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 1195632 (Why is no real title available?)
- scientific article; zbMATH DE number 1215044 (Why is no real title available?)
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
- Decomposing Matrices into Blocks
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Integer Programming Formulation of Traveling Salesman Problems
- Integer Programming Formulations for the k-Cardinality Tree Problem
- Integer programming approaches to facilities layout models with forbidden areas
- Local search algorithms for the \(k\)-cardinality tree problem.
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
- New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Revisiting dynamic programming for finding optimal subtrees in trees
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving Steiner tree problems in graphs to optimality
- Solving Steiner tree problems in graphs with Lagrangian relaxation
- Solving the Steiner Tree Problem on a Graph Using Branch and Cut
- Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
- Spanning Trees—Short or Small
- The Steiner tree polytope and related polyhedra
- The volume algorithm revisited: relation with bundle methods
- Tree polytope on 2-trees
- Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- Validation of subgradient optimization
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
- Weighted k‐cardinality trees: Complexity and polyhedral structure
- \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
Cited in
(9)- Connected power domination in graphs
- Algorithms for the maximum weight connected \(k\)-induced subgraph problem
- New branch-and-bound algorithms for \(k\)-cardinality tree problems
- Computational approaches for zero forcing and related problems
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
- An integer program for positive semidefinite zero forcing in graphs
- On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem
- Extended formulations for the cardinality constrained subtree of a tree problem
- Integer Programming Formulations for the k-Cardinality Tree Problem
This page was built for publication: The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987675)
