DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Polyhedral Combinatorics
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By American Mathematical Society

9780821865910

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the chromatic index of multigraphs and a conjecture of Seymour, (II)

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Polyhedral Combinatorics ◽

10.1090/dimacs/001/20 ◽

1991 ◽

pp. 1-1

Author(s):

Odile Marcotte

Keyword(s):

Chromatic Index

Download Full-text

Existentially polytime theorems

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Polyhedral Combinatorics ◽

10.1090/dimacs/001/09 ◽

1991 ◽

pp. 1-1 ◽

Cited By ~ 1

Author(s):

Kathie Cameron ◽

Jack Edmonds

Download Full-text

Vertex-disjoint simple paths of given homotopy in a planar graph

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Polyhedral Combinatorics ◽

10.1090/dimacs/001/13 ◽

1991 ◽

pp. 1-1

Author(s):

A. Frank ◽

A. Schrijver

Keyword(s):

Planar Graph ◽

Simple Paths ◽

Vertex Disjoint

Download Full-text

Planar multicommodity flows, max cut, and the Chinese postman problem

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Polyhedral Combinatorics ◽

10.1090/dimacs/001/17 ◽

1991 ◽

pp. 1-1 ◽

Cited By ~ 1

Author(s):

Francisco Barahona

Keyword(s):

Multicommodity Flows ◽

Chinese Postman Problem ◽

Chinese Postman

Download Full-text

On Lehman’s width-length characterization

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Polyhedral Combinatorics ◽

10.1090/dimacs/001/11 ◽

1991 ◽

pp. 1-1 ◽

Cited By ~ 6

Author(s):

P. Seymour

Download Full-text

On the complexity of branch and cut methods for the traveling salesman problem

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Polyhedral Combinatorics ◽

10.1090/dimacs/001/08 ◽

1991 ◽

pp. 1-1 ◽

Cited By ~ 1

Author(s):

W. Cook ◽

M. Hartmann

Keyword(s):

Traveling Salesman Problem ◽

Branch And Cut ◽

Traveling Salesman ◽

The Traveling Salesman Problem

Download Full-text

Test sets for integer programs, ∀∃ sentences

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Polyhedral Combinatorics ◽

10.1090/dimacs/001/05 ◽

1991 ◽

pp. 1-1 ◽

Cited By ~ 4

Author(s):

Ravi Kannan

Keyword(s):

Integer Programs ◽

Test Sets

Download Full-text

Matrix cones, projection representations, and stable set polyhedra

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Polyhedral Combinatorics ◽

10.1090/dimacs/001/01 ◽

1991 ◽

pp. 1-1 ◽

Cited By ~ 1

Author(s):

L. Lovász ◽

A. Schrijver

Keyword(s):

Stable Set

Download Full-text

Spanning trees of different weights

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Polyhedral Combinatorics ◽

10.1090/dimacs/001/21 ◽

1991 ◽

pp. 1-1 ◽

Cited By ~ 1

Author(s):

A. Schrijver ◽

P. Seymour

Keyword(s):

Spanning Trees

Download Full-text

Exact edge-colorings of graphs without prescribed minors

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Polyhedral Combinatorics ◽

10.1090/dimacs/001/19 ◽

1991 ◽

pp. 1-1

Author(s):

Odile Marcotte

Keyword(s):

Edge Colorings

Download Full-text

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Polyhedral CombinatoricsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By American Mathematical Society

On the chromatic index of multigraphs and a conjecture of Seymour, (II)

Existentially polytime theorems

Vertex-disjoint simple paths of given homotopy in a planar graph

Planar multicommodity flows, max cut, and the Chinese postman problem

On Lehman’s width-length characterization

On the complexity of branch and cut methods for the traveling salesman problem

Test sets for integer programs, ∀∃ sentences

Matrix cones, projection representations, and stable set polyhedra

Spanning trees of different weights

Exact edge-colorings of graphs without prescribed minors

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Polyhedral Combinatorics
Latest Publications