Primal separation for 0/1 polytopes
type: Item
instance of: scholarly article
title: Primal separation for 0/1 polytopes
zbMATH Open document ID: 1023.90041
author: Friedrich Eisenbrand
author: G. Rinaldi
author: P. Ventura
published in: Mathematical Programming. Series A. Series B
publication date: 2003-07-13T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1948560
zbMATH Keywords: 0/1 optimization
zbMATH Keywords: primal separation
zbMATH Keywords: matching polytopes
zbMATH Keywords: stable set
zbMATH Keywords: polytope
zbMATH Keywords: cut polytope
zbMATH Keywords: bipartite subgraph
MaRDI profile type: MaRDI publication profile
full work available at URL: s10107-002-0309-y
OpenAlex ID: W1991179071
Wikidata QID: Q58002915
DOI: 10.1007/S10107-002-0309-Y
Recommended article: Q4829031
Recommended article: Primal separation algorithms
Recommended article: Integer Programming and Combinatorial Optimization
Recommended article: A separation algorithm for the matchable set polytope
Recommended article: On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming
description: scientific article; zbMATH DE number 1948560