Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2011

Highly Cited

2011

The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is… Expand

Is this relevant?

Highly Cited

2011

Highly Cited

2011

Use of Lagrange Interpolating Polynomials in RLT. Systems in Series. Parallel Configurations. Spanning trees. Recycling. Split… Expand

Is this relevant?

2011

2011

We propose a novel web page segmentationalgorithm based on finding the Gomory-Hu tree in a planargraph. The algorithm firstly… Expand

Is this relevant?

2008

2008

Let G D .V;E/ be an undirected graph with jV j D n and jEj D m. The edge connectivity of two vertices s; t 2 V , denoted by .s; t… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V,E). The expected… Expand

Is this relevant?

2007

2007

In the early 90’s, the research community was unanimous: In order to solve integer programs of meaningful sizes, one had to… Expand

Is this relevant?

2004

2004

In this paper we examine two possible generalisations of total unimodularity, viz., total k-modularity and k-regularity. Total k… Expand

Is this relevant?

2002

2002

Abstract Let P ≔ {x∈ R n : Ax⩽b} be a polyhedron and PI its integral hull. A Chvatal–Gomory (CG) cut is a valid inequality for PI… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

Chvatal-Gomory and Gomory fractional cuts are well-known cutting planes for pure integer programming problems. Various methods… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

We investigate the use of Gonory's mixed integer cuts within a branch-and-cut framework. It has been argued in the literature… Expand

Is this relevant?