C. Feremans

发表

The Generalized Subgraph Problem: Complexity, Approximability and Polyhedra

M. Labbé, A. Letchford, J. Salazar, 2003 .

The Generalized Subgraph Problem : Valid inequalities and separation

Juan José SALAZAR-GONZÁLEZ, M. Labbé, A. Letchford, 2005 .

On the minimum corridor connection and other generalized geometric problems

Thomas Erlebach, Alexander Grigoriev, René Sitters, 2006 .

The generalized minimum spanning tree problem: Polyhedral analysis and branch‐and‐cut algorithm

Gilbert Laporte, Martine Labbé, Corinne Feremans, 2004, Networks.

A comparative analysis of several formulations for the generalized minimum spanning tree problem

Gilbert Laporte, Corinne Feremans, Martine Labbé, 2002, Networks.

Generalized network design problems

Gilbert Laporte, Martine Labbé, Corinne Feremans, 2003, Eur. J. Oper. Res..

On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems

Alexander Grigoriev, René Sitters, Thomas Wolle, 2006, WAOA.

Polyhedral Analysis of the Generalized Minimum Spanning Tree Problem

Gilbert Laporte, Martine Labbé, Corinne Feremans, 1999 .

The geometric generalized minimum spanning tree problem with grid clustering

Alexander Grigoriev, René Sitters, Corinne Feremans, 2006, 4OR.

An approximation scheme for the generalized geometric minimum spanning tree problem with grid clustering

Alexander Grigoriev, Corinne Feremans, A. Grigoriev, 2004 .