The Generalized Subgraph Problem: Complexity, Approximability and Polyhedra

C. Feremans, M. Labbé, A. Letchford, J.J. Salazar

Research output: Working paper / Preprint › Working paper

Original language	English
Place of Publication	Maastricht
Publisher	Maastricht University School of Business and Economics
Publication status	Published - 1 Jan 2003

Cite this

@techreport{18e1c33e7bc341f6a0981fe39666d50b,

title = "The Generalized Subgraph Problem: Complexity, Approximability and Polyhedra",

author = "C. Feremans and M. Labb{\'e} and A. Letchford and J.J. Salazar",

year = "2003",

month = jan,

day = "1",

language = "English",

publisher = "Maastricht University School of Business and Economics",

type = "WorkingPaper",

institution = "Maastricht University School of Business and Economics",

}

TY - UNPB

T1 - The Generalized Subgraph Problem: Complexity, Approximability and Polyhedra

AU - Feremans, C.

AU - Labbé, M.

AU - Letchford, A.

AU - Salazar, J.J.

PY - 2003/1/1

Y1 - 2003/1/1

M3 - Working paper

BT - The Generalized Subgraph Problem: Complexity, Approximability and Polyhedra

PB - Maastricht University School of Business and Economics

CY - Maastricht

ER -