Trees and Cuts

DOI10.1016/S0304-0208(08)73429-7MaRDI QIDQ3674420zbMATH OpenFDO

Authors 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)

Full work available at URL https://doi.org/10.1016/S0304-0208(08)73429-7

zbMATH Keywords

facetfacet- identification problemmaximum flow calculationsmaximum weighted tree problemminimum cutundirected graph

Mathematics Subject Classification ID

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

Cited in

(27)

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

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)