Exact Algorithms for Generalized Combinatorial Optimization Problems

We discuss fast exponential time exact algorithms for generalized combinatorial optimization problems. The list of discussed NP-complete generalized combinatorial optimization problems includes the generalized minimum spanning tree problem, the generalized subset assignment problem and the generalized travelling salesman problem.

[1]  Gilbert Laporte,et al.  A comparative analysis of several formulations for the generalized minimum spanning tree problem , 2002, Networks.

[2]  Petrica C. Pop.  On the prize-collecting generalized minimum spanning tree problem , 2007, Ann. Oper. Res..

[3]  James C. Bean,et al.  A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem , 1991, Oper. Res..

[4]  Petrica C. Pop,et al.  A new relaxation method for the generalized minimum spanning tree problem , 2006, Eur. J. Oper. Res..

[5]  Matteo Fischetti,et al.  The symmetric generalized traveling salesman polytope , 1995, Networks.

[6]  Moshe Dror,et al.  Generalized spanning trees , 2000, Eur. J. Oper. Res..

[7]  Petrica C. Pop.  Relaxation methods for the generalized minimum spanning tree problem , 2002 .

[8]  Gilbert Laporte,et al.  Some Applications of the Generalized Travelling Salesman Problem , 1996 .

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  M. Fisher,et al.  A multiplier adjustment method for the generalized assignment problem , 1986 .

[11]  Petrica C. Pop.  New Models of the Generalized Minimum Spanning Tree Problem , 2004, J. Math. Model. Algorithms.

[12]  Young-Soo Myung,et al.  On the generalized minimum spanning tree problem , 1995, Networks.

[13]  G. Laporte,et al.  Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach , 1983 .

[14]  Moshe Dror,et al.  Generalized Steiner Problems and Other Variants , 2000, J. Comb. Optim..

[15]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[16]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..

[17]  Corinne Feremans.  Generalized Spanning Trees and Extensions , 2001 .

[18]  P. Pop.  The generalized minimum spanning tree problem , 2000 .

[19]  M. Yannakakis.  Expressing combinatorial optimization problems by linear programs , 1991, Symposium on the Theory of Computing.