Maximum matching and a polyhedron with 0,1-vertices

Cited in

(only showing first 100 items - show all)

On the stochastic independence properties of hard-core distributions
Heuristically guided search and chromosome matching
Unions of perfect matchings in cubic graphs
Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
Structural properties of matroid matchings
Box-total dual integrality and edge-connectivity
A weighted independent even factor algorithm
Separation routine and extended formulations for the stable set problem in claw-free graphs
Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs
Coverage, matching, and beyond: new results on budgeted mechanism design
Blocking versus nonblocking interprocess communication: A note on the effect on concurrency
On the expansion of combinatorial polytopes
On a cutting plane heuristic for the stable roommates problem and its applications
The strong perfect graph conjecture: 40 years of attempts, and its resolution
Nice pairs of disjoint pentagons in fullerene graphs
Nice pairs of odd cycles in fullerene graphs
Euclidean maximum matchings in the plane -- local to global
On the facets of stable set polytopes of circular interval graphs
A revival of the girth conjecture
Short proofs on the matching polyhedron
On matroid parity and matching polytopes
A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron
Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
A branch-and-price algorithm for solving the Hamiltonian \(p\)-median problem
A new linear programming algorithm - better or worse than the simplex method?
A parallel primal-dual simplex algorithm
Graph edge coloring: a survey
An Eulerian exposition
Exploiting planarity in separation routines for the symmetric traveling salesman problem
Subspaces with well-scaled frames
Characterizing and bounding the imperfection ratio for some classes of graphs
A shortest augmenting path method for solving minimal perfect matching problems
Uncapacitated flow-based extended formulations
A weighted even factor algorithm
Optimum matching forests I: Special weights
Optimum matching forests II: General weights
The limits of local search for weighted \(k\)-set packing
Detecting strong cliques
A note on matchings and separability
On perfectly two-edge connected graphs
On Hilbert bases of cuts
The stable set polytope of icosahedral graphs
Makespan minimization in a no-wait flow shop problem with two batching machines
Lift and project relaxations for the matching and related polytopes
Incremental assignment problem
The circular chromatic index of graphs of high girth
Dynamic matchings and quasidynamic fractional matchings. II
Optimal cuts in graphs and statistical mechanics
scientific article; zbMATH DE number 1769330 (Why is no real title available?)
Grid graphs, Gorenstein polytopes, and domino stackings
On the Stable Set Polytope of Claw-Free Graphs
An equivalent formulation of the Fan-Raspaud conjecture and related problems
A partitioning algorithm for minimum weighted Euclidean matching
Weighted restricted 2-matching
Partitioning heuristics for two geometric maximization problems
Even factors of graphs
The complexity of lifted inequalities for the knapsack problem
Total dual integrality and b-matchings
Graph substitution and set packing polytopes
Solving large-scale matching problems efficiently: A new primal matching approach
Maximal matching polytope in trees
The monotonic diameter of the perfect matching and shortest path polytopes
Clique-circulants and the stable set polytope of fuzzy circular interval graphs
Partial ML estimation for spatial autoregressive nonlinear probit models with autoregressive disturbances
On the minors of an incidence matrix and Smith normal form
Complexity of the cluster deletion problem on subclasses of chordal graphs
Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
Approximating the chromatic index of multigraphs
On the \(k\)-systems of a simple polytope
A lower bound to the complexity of Euclidean and rectilinear matching algorithms
Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus
Matrices with the Edmonds-Johnson property
The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
A note on 1-factors in certain regular multigraphs
A characterization of graphs with fractional total chromatic number equal to \(\Delta +2\)
On the chromatic index of multigraphs and a conjecture of Seymour (I)
The generalized arc routing problem
Tutte sets in graphs I: Maximal tutte sets and D-graphs
A separation algorithm for the matchable set polytope
Some sequences associated with combinatorial structures
Avoiding 5-Circuits in 2-Factors of Cubic Graphs
Short trading cycles: paired kidney exchange with strict ordinal preferences
A polyhedral approach to edge coloring
A new pivoting strategy for Gaussian elimination
Approximation algorithms for multiple terminal, Hamiltonian path problems
1-Approximation algorithm for bottleneck disjoint path matching
The traveling salesman problem: An update of research
The perfectly matchable subgraph polytope of an arbitrary graph
On facets of stable set polytopes of claw-free graphs with stability number 3
A note on shortest cycle covers of cubic graphs
A note on symmetric doubly-stochastic matrices
Integer programming approaches to the travelling salesman problem
On Kuhn's Hungarian Method?A tribute from Hungary
Bi-criteria and approximation algorithms for restricted matchings
A comparison of two edge-coloring formulations
Integer programs for logic constraint satisfaction
Lovász-Schrijver PSD-operator on claw-free graphs
Rational and integral \(k\)-regular matrices.
The stable set polytope of claw-free graphs with large stability number
A generalization of extension complexity that captures P

This page was built for publication: Maximum matching and a polyhedron with 0,1-vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5516087)