Trees and Cuts

DOI10.1016/S0304-0208(08)73429-7zbMATH Open0522.90095MaRDI QIDQ3674420FDOQ3674420

Manfred Padberg, Laurence A. Wolsey

Publication date: 1983

Published in: Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

facetminimum cutundirected graphfacet- identification problemmaximum flow calculationsmaximum weighted tree problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Deterministic network models in operations research (90B10)

Cited In (26)

• Hypergraphic submodular function minimization
• Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
• Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
• Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
• Modeling and solving the angular constrained minimum spanning tree problem
• Minimum power multicasting problem in wireless networks
• The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms
• Graphic Submodular Function Minimization: A Graphic Approach and Applications
• On some algorithmic aspects of hypergraphic matroids
• Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
• On approximately fair cost allocation in Euclidean TSP games
• A note on the generalized Steiner tree polytope
• A computational study on the maximum-weight bounded-degree rooted tree problem
• Strong lower bounds for the prize collecting Steiner problem in graphs
• Combined column-and-row-generation for the optimal communication spanning tree problem
• Boolean polynomials and set functions
• The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
• Optimizing over the subtour polytope of the travelling salesman problem
• Using separation algorithms to generate mixed integer model reformulations
• Separation of partition inequalities with terminals
• Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem
• An efficient algorithm for the minimum capacity cut problem
• A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
• Network reinforcement
• Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
• Classical cuts for mixed-integer programming and branch-and-cut

This page was built for publication: Trees and Cuts

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