Stable set reformulations for the degree preserving spanning tree problem

DOI10.1016/J.EJOR.2024.06.031MaRDI QIDQ6982619zbMATH OpenFDO

Authors Abilio Lucena, Alexandre Salles da Cunha

Publication date 16 May 2025

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2024.06.031

zbMATH Keywords

branch-and-cut algorithmscombinatorial benders decompositioncombinatorial optimizationdegree preserving spanning treesstable set

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A tutorial on branch and cut algorithms for the maximum stable set problem
• Algorithm 457: finding all cliques of an undirected graph
• An exact algorithm for the maximum leaf spanning tree problem.
• Benchmarking optimization software with performance profiles.
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Conflict graphs in solving integer programming problems
• Efficiently enumerating all maximal cliques with bit-parallelism
• Formulations and exact solution approaches for the degree preserving spanning tree problem
• scientific article; zbMATH DE number 1563034 (Why is no real title available?)
• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• scientific article; zbMATH DE number 1420489 (Why is no real title available?)
• Matroids and the greedy algorithm
• On Local Search and Placement of Meters in Networks
• On the facial structure of set packing polyhedra
• On the optimal design of water distribution networks: a practical MINLP approach
• Properties of vertex packing and independence system polyhedra
• Reformulation by intersection method on the MST problem with lower bound on the number of leaves
• The degree-preserving spanning tree problem in strongly chordal and directed path graphs
• The multi-weighted Steiner tree problem: A reformulation by intersection

This page was built for publication: Stable set reformulations for the degree preserving spanning tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982619)