Odd Minimum Cut Sets and b-Matchings Revisited
From MaRDI portal
Publication:3648510
DOI10.1137/060664793zbMath1178.90290arXivmath/0607088OpenAlexW2037713871WikidataQ57702262 ScholiaQ57702262MaRDI QIDQ3648510
Dirk Oliver Theis, Adam N. Letchford, Gerhard Reinelt
Publication date: 27 November 2009
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0607088
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles, The stable fixtures problem with payments, Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem, A branch-and-cut algorithm for the maximum benefit Chinese postman problem, The generalized arc routing problem, A Branch-and-Cut method for the Capacitated Location-Routing Problem, The multi‐purpose K‐drones general routing problem, Hidden Hamiltonian Cycle Recovery via Linear Programming, Densities, Matchings, and Fractional Edge-Colorings, Undirected postman problems with zigzagging option: a cutting-plane approach, Facets from gadgets, On the transportation problem with market choice, An exact algorithm for solving the ring star problem, A computational study on the maximum-weight bounded-degree rooted tree problem, An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations, Binary Steiner trees: structural results and an exact solution approach, Parity polytopes and binarization, The Stable Fixtures Problem with Payments, Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
