Heinz Gröflin

According to our database, Heinz Gröflin authored at least 15 papers between 1981 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2017

The no-wait job shop with regular objective: a method based on optimal job insertion.

Reinhard Bürgy, Heinz Gröflin

J. Comb. Optim., 2017

2016

The blocking job shop with rail-bound transportation.

Reinhard Bürgy, Heinz Gröflin

J. Comb. Optim., 2016

2013

Optimal job insertion in the no-wait job shop.

Reinhard Bürgy, Heinz Gröflin

J. Comb. Optim., 2013

2011

The flexible blocking job shop with transfer and set-up times.

Heinz Gröflin, Dinh-Nguyen Pham, Reinhard Bürgy

J. Comb. Optim., 2011

2009

A new neighborhood and tabu search for the Blocking Job Shop.

Heinz Gröflin, Andreas Klinkert

Discret. Appl. Math., 2009

2008

Feasible job insertions in the multi-processor-task job shop.

Heinz Gröflin, Andreas Klinkert, Dinh-Nguyen Pham

Eur. J. Oper. Res., 2008

2007

Feasible insertions in job shop scheduling, short cycles and stable sets.

Heinz Gröflin, Andreas Klinkert

Eur. J. Oper. Res., 2007

2002

On the submodular matrix representation of a digraph.

Arlette Gaillard, Heinz Gröflin, Alan J. Hoffman, William R. Pulleyblank

Theor. Comput. Sci., 2002

1997

Optimum Partitioning into Intersections of Ring Families.

Maurice Cochand, Arlette Gaillard, Heinz Gröflin

Discret. Appl. Math., 1997

1992

Lattice matrices, intersection of ring families and dicuts.

Maurice Cochand, Arlette Gaillard, Heinz Gröflin

Discret. Math., 1992

1987

On switching path polyhedra.

Heinz Gröflin

Comb., 1987

1985

On node constraint networks.

Heinz Gröflin

Networks, 1985

1984

Path-closed sets.

Heinz Gröflin

Comb., 1984

1981

Connected and alternating vectors: Polyhedra and algorithms.

Heinz Gröflin, Thomas M. Liebling

Math. Program., 1981

On matroid intersections.

Heinz Gröflin, Alan J. Hoffman

Comb., 1981