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.

Paper

HAG-based application layer multicast system for streaming media

Ruixiong Tian, Zhe Xiang, et al.

Qinghua Daxue Xuebao/Journal of Tsinghua University

Paper

An information statistics approach to data stream and communication complexity

Ziv Bar-Yossef, T.S. Jayram, et al.

Journal of Computer and System Sciences

Paper

On the distance to the zero-set of a polynomial

Matthew A Grayson

Journal of Complexity

Paper

Irredundancy in circular arc graphs

Martin Charles Golumbic, Renu C. Laskar

Discrete Applied Mathematics

View all publications

Abstract

Related

HAG-based application layer multicast system for streaming media

An information statistics approach to data stream and communication complexity

On the distance to the zero-set of a polynomial

Irredundancy in circular arc graphs