scientific article; zbMATH DE number 3499169
From MaRDI portal
zbMath0318.65027MaRDI QIDQ4080661
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05)
Related Items
On the chromatic index of multigraphs and a conjecture of Seymour (I), A separation algorithm for the matchable set polytope, Constrained multi-object auctions and \(b\)-matching, A polynomial algorithm for b-matchings: An alternative approach, A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem, Polyhedral characterizations and perfection of line graphs, 2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings, Matchings in regular graphs, Adjacent vertices on the b-matching polyhedron, Total dual integrality and b-matchings, Approximation algorithms for bounded degree phylogenetic roots, Matching theory -- a sampler: From Dénes König to the present, Structural properties of matroid matchings, Regularisable graphs, II, Factor-critical graphs with the minimum number of near-perfect matchings, Fractional matroid matchings, Solving the linear matroid parity problem as a sequence of matroid intersection problems, The connection between the bump number problem and flow-shop scheduling with precedence constraints, Rank of maximum matchings in a graph, Optimum matching forests I: Special weights, Optimum matching forests II: General weights, Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem, The traveling salesman problem on a graph and some related integer polyhedra, Some facets of the simple plant location polytope, A note on matchings and separability, Optimizing over the subtour polytope of the travelling salesman problem, An algorithm for minimizing setups in precedence constrained scheduling
