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)
Related Items
A separation algorithm for the matchable set polytope, A Polytope for a Product of Real Linear Functions in 0/1 Variables, An analytic symmetrization of max flow-min cut, Global optimization of a quadratic function subject to a bounded mixed integer constraint set, Matchability and \(k\)-maximal matchings, Improved algorithms for even factors and square-free simple \(b\)-matchings, Toric rings of perfectly matchable subgraph polytopes, PQ-type adjacency polytopes of join graphs, Projecting systems of linear inequalities with binary variables, \(b\)-matching degree-sequence polyhedra, An analytical comparison of different formulations of the travelling salesman problem, The maximum fuzzy weighted matching models and hybrid genetic algorithm, Extended formulations in combinatorial optimization, The convex hull of two core capacitated network design problems, Extended formulations in combinatorial optimization, Discrete relaxations of combinatorial programs, Perfectly matchable subgraph problem on a bipartite graph, The optimal path-matching problem, The perfectly matchable subgraph polytope of an arbitrary graph, Projections of the capacitated network loading problem, Local search procedures for improving feasible solutions to the sequential ordering problem, Stable sets and polynomials, Projection, lifting and extended formulation integer and combinatorial optimization
Cites Work
