\(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
type: Item
instance of: scholarly article
title: \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
zbMATH Open document ID: 0855.90088
DOI: 10.1007/BF02592196
author: Alberto Caprara
author: Matteo Fischetti
published in: Mathematical Programming. Series A. Series B
publication date: 1996-11-24T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 52B12
zbMATH DE Number: 940769
zbMATH Keywords: integer polyhedron
zbMATH Keywords: valid inequality
zbMATH Keywords: separation problem
zbMATH Keywords: binary clutter
zbMATH Keywords: polynomial time
zbMATH Keywords: clique partitioning
zbMATH Keywords: asymmetric traveling salesman
zbMATH Keywords: plant location
zbMATH Keywords: acyclic subgraph
zbMATH Keywords: linear ordering polytopes
MaRDI profile type: Publication
cites work: The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
cites work: Characterization of Totally Unimodular Matrices
cites work: The partition problem
cites work: Q3351135
cites work: Clique-Web Facets for Multicut Polytopes
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Q5675543
cites work: Q4198056
cites work: Matrices with the Edmonds-Johnson property
cites work: A Cutting Plane Algorithm for the Linear Ordering Problem
cites work: On the acyclic subgraph polytope
cites work: Facets of the linear ordering polytope
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Weakly bipartite graphs and the max-cut problem
cites work: Facets of the clique partitioning polytope
cites work: Q4234162
cites work: Q4040221
cites work: Odd Minimum Cut-Sets and b-Matchings
cites work: Q3818127
cites work: Decomposition of regular matroids
description: scientific article; zbMATH DE number 940769