The perfectly matchable subgraph polytope of an arbitrary graph
From MaRDI portal
Publication:757431
DOI10.1007/BF02125345zbMath0723.05087MaRDI QIDQ757431
Egon Balas, William R. Pulleyblank
Publication date: 1989
Published in: Combinatorica (Search for Journal in Brave)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Perfectly matchable subgraph problem on a bipartite graph, Extended formulations in combinatorial optimization, Discrete relaxations of combinatorial programs, Matchability and \(k\)-maximal matchings, The convex hull of two core capacitated network design problems, The perfectly matchable subgraph polytope of an arbitrary graph, Projection, lifting and extended formulation integer and combinatorial optimization, The maximum fuzzy weighted matching models and hybrid genetic algorithm, \(b\)-matching degree-sequence polyhedra, An analytical comparison of different formulations of the travelling salesman problem, The optimal path-matching problem, Local search procedures for improving feasible solutions to the sequential ordering problem, Stable sets and polynomials, A separation algorithm for the matchable set polytope, An analytic symmetrization of max flow-min cut, Projections of the capacitated network loading problem, Global optimization of a quadratic function subject to a bounded mixed integer constraint set
Cites Work
