Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation

Jon Lee; Janny Leung; Sven De Vries

doi:10.1007/s10878-005-5484-3

J Combin Optim

Paper

01 Feb 2005

Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation

View publication

Abstract

In this note, we describe an efficient algorithm for separating a class of inequalities that includes the type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation. © 2005 Springer Science + Business Media, Inc.

Conference paper

On the Convergence of Gradient Descent in GANs: MMD GAN As a Gradient Flow

Conference paper

On Application of the Simplex Type Algorithm for SCLP to Large-scale Fluid Processing Networks

Conference paper

Unassisted true analog neural network training chip

Conference paper

Federated Nearest Neighbor Classification with a Colony of Fruit-Flies

View all publications

Abstract

Related

On the Convergence of Gradient Descent in GANs: MMD GAN As a Gradient Flow

On Application of the Simplex Type Algorithm for SCLP to Large-scale Fluid Processing Networks

Unassisted true analog neural network training chip

Federated Nearest Neighbor Classification with a Colony of Fruit-Flies