A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
From MaRDI portal
Publication:6087142
DOI10.1002/net.22009MaRDI QIDQ6087142
Francesco Carrabs, Manlio Gaudioso
Publication date: 11 December 2023
Published in: Networks (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The minimum cost perfect matching problem with conflict pair constraints
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
- The maximum flow problem with disjunctive constraints
- Lower and upper bounds for the spanning tree with minimum branch vertices
- The minimum spanning tree problem with conflict constraints and its variations
- Paths, trees and matchings under disjunctive constraints
- About Lagrangian methods in integer optimization
- On solving the Lagrangian dual of integer programs via an incremental approach
- Truck synchronization at single door cross-docking terminals
- The quadratic minimum spanning tree problem and its variations
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- The Knapsack Problem with Conflict Graphs
- Determining a Minimum Spanning Tree with Disjunctive Constraints
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
- Trees in Graphs with Conflict Edges or Forbidden Transitions
- An Integer Programming Model for Branching Cable Layouts in Offshore Wind Farms
This page was built for publication: A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
