Polyhedral results and stronger Lagrangean bounds for stable spanning trees
From MaRDI portal
Publication:6110626
DOI10.1007/s11590-022-01949-8zbMath1527.90261arXiv2208.13014MaRDI QIDQ6110626
Publication date: 6 July 2023
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.13014
polyhedrastable setsdual ascentopen-source softwarelagrangean decompositionconflict-free spanning trees
Programming involving graphs or networks (90C35) Trees (05C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Best subset selection via a modern optimization lens
- The minimum spanning tree problem with conflict constraints and its variations
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Paths, trees and matchings under disjunctive constraints
- Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Matrices with the Edmonds-Johnson property
- The volume algorithm revisited: relation with bundle methods
- The volume algorithm: Producing primal solutions with a subgradient method
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- Lagrangean relaxation. (With comments and rejoinder).
- Fixed cardinality stable sets
- Sparse regression: scalable algorithms and empirical performance
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- Comparison of bundle and classical column generation
- ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
- Determining a Minimum Spanning Tree with Disjunctive Constraints
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Matroids and the greedy algorithm
- A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
- Polyhedral results and stronger Lagrangean bounds for stable spanning trees
This page was built for publication: Polyhedral results and stronger Lagrangean bounds for stable spanning trees
