Trees and Cuts
From MaRDI portal
Publication:3674420
DOI10.1016/S0304-0208(08)73429-7zbMath0522.90095MaRDI QIDQ3674420
Manfred W. 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)
minimum cutundirected graphfacetfacet- identification problemmaximum flow calculationsmaximum weighted tree problem
Programming involving graphs or networks (90C35) Trees (05C05) Deterministic network models in operations research (90B10)
Related Items
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach, Separation of partition inequalities with terminals, 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, Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem, Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem, On approximately fair cost allocation in Euclidean TSP games, Hypergraphic submodular function minimization, Graphic Submodular Function Minimization: A Graphic Approach and Applications, A note on the generalized Steiner tree polytope, An efficient algorithm for the minimum capacity cut problem, Using separation algorithms to generate mixed integer model reformulations, The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms, Classical cuts for mixed-integer programming and branch-and-cut, The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm, Minimum power multicasting problem in wireless networks, A computational study on the maximum-weight bounded-degree rooted tree problem, Strong lower bounds for the prize collecting Steiner problem in graphs, Modeling and solving the angular constrained minimum spanning tree problem, On some algorithmic aspects of hypergraphic matroids, Boolean polynomials and set functions, Network reinforcement, Optimizing over the subtour polytope of the travelling salesman problem, Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
