Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs

DOI10.1137/16M1089691zbMath1422.90071arXiv1607.01880OpenAlexW2963442851MaRDI QIDQ5232142

Matthias Walter

Publication date: 29 August 2019

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.01880

zbMATH Keywords

bipartite matchingmatching polytopequadratic matching problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)

Related Items (1)

Matroid optimization problems with monotone monomials in the objective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial optimization with one quadratic term: spanning trees and forests
• On minimum reload cost cycle cover
• A survey for the quadratic assignment problem
• Short proofs on the matching polyhedron
• The ellipsoid method and its consequences in combinatorial optimization
• Matroid optimisation problems with nested non-linear monomials in the objective function
• An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Complete description for the spanning tree problem with one linearised quadratic term
• Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
• Odd Minimum Cut-Sets and b-Matchings
• P-Complete Approximation Problems
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• A Short Proof of the Factor Theorem for Finite Graphs

This page was built for publication: Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs