The perfectly matchable subgraph polytope of an arbitrary graph
From MaRDI portal
(Redirected from Publication:757431)
Recommendations
Cites work
- scientific article; zbMATH DE number 3496213 (Why is no real title available?)
- Maximum matching and a polyhedron with 0,1-vertices
- Paths, Trees, and Flowers
- Perfect matchings of a graph
- The Factorization of Linear Graphs
- The perfectly matchable subgraph polytope of a bipartite graph
- The perfectly matchable subgraph polytope of an arbitrary graph
Cited in
(31)- Skeleton matching polytope: realization and isomorphism
- The Graphs with All Subgraphs T-Perfect
- Matchability and \(k\)-maximal matchings
- A polytope for a product of real linear functions in 0/1 variables
- The convex hull of two core capacitated network design problems
- The perfect matching polytope and solid bricks
- Discrete relaxations of combinatorial programs
- Extended formulations in combinatorial optimization
- An analytical comparison of different formulations of the travelling salesman problem
- b-matching degree-sequence polyhedra
- Stable sets and polynomials
- Improved algorithms for even factors and square-free simple \(b\)-matchings
- Toric rings of perfectly matchable subgraph polytopes
- When is the matching polytope box-totally dual integral?
- Local search procedures for improving feasible solutions to the sequential ordering problem
- Extended formulations in combinatorial optimization
- The perfectly matchable subgraph polytope of an arbitrary graph
- The optimal path-matching problem
- Projections of the capacitated network loading problem
- Projection, lifting and extended formulation integer and combinatorial optimization
- PQ-type adjacency polytopes of join graphs
- A separation algorithm for the matchable set polytope
- On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs
- An analytic symmetrization of max flow-min cut
- Projecting systems of linear inequalities with binary variables
- Global optimization of a quadratic function subject to a bounded mixed integer constraint set
- scientific article; zbMATH DE number 4077256 (Why is no real title available?)
- Dominants and submissives of matching polyhedra
- Perfectly matchable subgraph problem on a bipartite graph
- The maximum fuzzy weighted matching models and hybrid genetic algorithm
This page was built for publication: The perfectly matchable subgraph polytope of an arbitrary graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757431)
