@article{Baldacci02,
	author = {R. Baldacci and E. Hadjiconstantinou and V. Maniezzo and A. Mingozzi},
	title = {A new method for solving capacitated location problems based on a set partitioning approach},
	journal = {Computers and Operations Research},
	volume = {29},
	pages = {365--386},
	year = {2002}
}

@article{Beasley85,
	author = {{J.E.} Beasley},
	title = {A note on solving large p-median problems},
	journal = {European Journal of Operational Research},
	volume = {21},
	pages = {270--273},
	year = {1985}
}

@mastersthesis{Ceselli02,
	author = {A. Ceselli},
	title =	{Algoritmi branch and bound e branch and price per il problema delle p-mediane con capacit\`a},
	school = {Dipartimento di Tecnologie dell'Informazione, Universit\`a degli Studi di Milano},
	address = {Crema, Italy},
	year = {2002},
	note = {In Italian}
}

@article{Ceselli03,
	author = {A. Ceselli},
	title = {Two exact algorithms for the capacitated p-median problem},
	journal = {4OR},
	volume = {1},
	number = {4},
	pages = {319--340},
	year = {2003}
}

@article{ChristofidesBeasley81,
	author = {N. Christofides and {J.E.} Beasley},
	title = {A tree search algorithm for the p-median problem},
	journal = {European Journal of Operational Research},
	volume = {10},
	pages = {196--204},
	year = {1981}
}


@article{CornuejolsFisherNemhauser77,
	author = {G. Cornueojols and {M.L.} Fisher and {G.L.} Nemhauser},
	title = {Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms},
	journal = {Management Science},
	volume = {23},
	number = {8},
	pages = {789--810},
	year = {1977}
}

@inbook{Daskin00,

	author = {J. Current and M. Daskin and D. Schilling},
	year = {2002},
	title = {Discrete Network Location Models},
	booktitle = {Facility Location Theory:  Applications and Methods},
	editor = {Z. Drezner and H. Hamacher},
	publisher = {Springer Verlag, Berlin },
	pages = {81--118}
	
}

@article{Diaz02,
	author = {{J.A.} Diaz and E. Fern\'andez},
	title = {A branch-and-price algorithm for the single source capacitated plant location problem},
	journal = {Journal of the Operational Research Society},
	volume = {53},
	pages = {728--740},
	year = {2002}
}

@article{Diaz04,
	author = {{J.A.} Diaz and E. Fern\'andez},
	title = {Hybrid scatter search and path relinking for the capacitated p-median problem},
	journal = {European journal of Operational Research},
	year = {In press}
}




@article{LINPACK,
	author = {{J.J.} Dongarra},
	title = {Performance of various computers using standard linear equations software},
	journal = {University of Tennessee},
	year = {2005},
	note = {Technical Report, available at http://www.netlib.org/benchmark/performance.ps}
}

@article{Galvao79,
	author = {{R.D.} Galv{\~a}o},
	title = {A dual-bounded algorithm for the p-median problem},
	journal = {Operations Research},
	volume = {28},
	number = {5},
	year = {1979}
}

@article{GilmoreGomory61,
	author = {{P.C.} Gilmore and {R.E.} Gomory},
	title = {A Linear Programming Approach to the Cutting Stock Problem},
	journal = {Operations Research},
	volume = {9},
	pages = {849--859},
	year = {1961}
}

@article{HanjoulPeeters85,
	author = {P. Hanjoul and D. Peeters},
	title = {A comparison of two dual-based procedures for solving the p-median problem},
	journal = {European Journal of Operational Research},
	volume = {20},
	pages = {387--396},
	year = {1985}
}

@article{Held74,
	author = {M. Held and P. Wolfe and {H.P.} Crowder},
	title =  {Validation of Subgradient Optimization},
	journal = {Mathematical Programming},
	volume = {6},
	pages = {62--88},
	year = {1974}
}

@article{Jornsten86,
	author = {K. J\"ornsten and M. N\"asberg},
	title =  {A new lagrangean relaxation approach to the generalized assignment problem},
	journal = {European journal of Operational Research},
	volume = {27},
	pages = {313--323},
	year = {1986}
}

@article{KarivHakimi79,
	author = {O. Kariv and {S.L.} Hakimi},
	title =  {Reducibility among combinatorial problems},
	journal = {SIAM Journal of Applied Mathematics},
	volume = {37},
	pages = {539--560},
	year = {1979}
}

@inbook{Karp72,
	author = {{R.M.} Karp},
	editor = {{R.E.} Miller and {J.W.} Thatcher},
	title = {Reducibility among combinatorial problems},
	booktitle = {Complexity of Computer Computations},
	publisher = {Plumunu Press, New York},
	pages = {85--103},
	year = 	{1972}
}

@article{Lorena05,
	author = {{E.L.F.} Senne and {L.A.N.} Lorena and {M.A.} Pereira},
	title = {A branch-and-price approach to p-median location problems},
	journal = {Computers and Operations Rsearch},
	volume = {32},
	number = {6},
	pages = {1655--1664},
	year = {2005}
}

@article{Lorena04,
	author = {L. Lorena and E. Senne},
	title =  {A column generation approach to capacitated p-median problems},
	journal = {Computers and Operations Research},
	volume = {31},
	number = {6},
	pages = {863--876},
	year = {2004}
}

@article{ManiezzoMingozziBaldacci98,
	author = {V. Maniezzo and A. Mingozzi and R. Baldacci},
	title =  {A Bionomic approach to the capacitated p-median problem},
	journal = {Journal of Heuristics},
	volume = {4},
	pages = {263--280},
	year = {1998}
}

@inbook{MT81c,
	author = {S. Martello and P. Toth},
	editor = {{J.P.} Brans},
	title = {An algorithm for the generalized assignment problem},
	booktitle = {Operational Research '81},
	pages = {589--603},
	year = 	{1981}
}

@BOOK{KnapsackProblems,
	author = {S. Martello and P. Toth},
	title = {Knapsack problems: Algorithms and Computer Implementations},
	publisher = {Wiley, New York},
	year = {1990}

}

@article{MulveyBeck84,
	author = {{J.M.} Mulvey and P. Beck},
	title =  {Solving capacitated clustering problems},
	journal = {European Journal of Operational Research},
	volume = {18},
	pages = {339--348},
	year = {1984}
}

@article{NarulaOgbuSamuelsson76,
	author = {{S.C} Narula and {U.I.} Ogbu and {H.M.} Samuelsson},
	title =  {An algorithm for the p-median problem},
	journal = {Operations Research},
	volume = {25},
	number = {4},
	year = {1977}
}

@inbook{NR,
	author = {M. Labb\'e and D. Peeters and {J.F.} Thisse},
	title = {Location on Networks, in Network Routing},
	volume = {8},
	booktitle = {Handbooks in OR and MS},
	publisher = {Elsevier Science B.V.},
	year = 	{1995}
}

@BOOK{NemWol,
	author = {{G.L.} Nemhauser and {L.A.} Wolsey},
	title = {Integer and combinatorial optimization},
	publisher = {Wiley - Interscience},
	year = {1988}

}

@book{Martin99,
	author = {R.K. Martin},
	title = {Large scale linear and integer optimization},
	publisher = {Kluwer},
	year = {1999}
}

@article{Rosing91,
	author = {K.E. Rosing},
	title = {Towards the solutions of the (generalised) multi-Weber problem},
	journal = {Environment and Planning, Series B},
	volume = {18},
	year = {1991},
	pages = {347--360}
}

@article{OsmanChristofides94,
	author = {{I.H.} Osman and N. Christofides},
	title =  {Capacitated clustering problems by hybrid Simulated Annealing and Tabu Search},
	journal = {International Transactions in Operational Research},
	volume = {13},
	pages = {317--336},
	year = {1994}
}

@article{Pirkul87,
	author = {H. Pirkul},
	title =  {Efficient algorithms for the capacitated concentrator location problem},
	journal = {Computers and Operations Research},
	volume = {14},
	number = {3},
	pages = {197--208},
	year = {1987}
}

@article{Pisinger95,
	author = {D. Pisinger},
	title = {A minimal algorithm for the multiple--choice knapsack problem},
	journal = {European Journal of Operational Research},
	volume = {83},
	number = {2},
	year = 	{1995},
	pages =	{392--410}
}

@article{RossSoland77,
	author = {{G.T.} Ross and {R.M.} Soland},
	title = {Modeling facility location problems as generalized assignment problems},
	journal = {Management Science},
	volume = {24},
	number = {3},
	year = 	{1977}
}

@article{Savelsbergh97,
	author = {M. Savelsbergh},
	title = {A branch-and-price algorithm for the generalized assignment problem},
	journal = {Operations Research},
	volume = {45},
	number = {6},
	year = 	{1997}
}
--------------------
@article{Syam97,
	author = {{S.S.} Syam},
	title = {A Model for the Capacitated p-Facility Location Problem in Global Environments},
	journal = {Computers Ops Res.},
	volume = {24},
	number = {11},
	pages = {1005--1016},
	year = 	{1997}
}

@article{Aardal98,
	author = {K. Aardal},
	title = {Capacitated Facility Location: Separation algorithms and computational experience},
	journal = {Mathematical Programming},
	volume = {81},
	pages = {149--175},
	year = 	{1998}
}

@techreport{Klose03,
	author = {A. Klose and S. G\"ortz},
	title = {A Branch-and-Price Algorithm for the Capacitated Facility Location Problem},
	institution = {University of St. Gallen and Wuppertal},
	year = {2003}
}
@inbook{Klose04,
	author = {A. Klose and S. G\"ortz},
	title = {An exact column generation approach to the capacitated facility location problem},
	booktitle = {Distribution Logistics: Advanced Solutions to Practical Problems},
	editor = {B. Fleischmann and A. Klose},
	series = {Lecture Notes in Economics and Mathematical Systems},
	volume = {544},
	publisher = {Springer, Berlin},
	year = {2004},
}

@article{Cortcap01,
	author = {{M.J.} Cortinhal and {M.E.} Captivo},
	title = {Genetic Algorithms for the Single Source Capacitated Location Problem: a Computational Study},
	journal = {MIC'2001 - 4th Metaheuristics International Conference},
	pages = {355--359},
	year = 	{2001}
}

@article{Scaparra,
	author = {{R.K.} Ahuja and {J.B.} Orlin and S. Pallottino and {M.P.} Scaparra and {M.G.} Scutell\'a},
	title = {A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem},
}

@article{Gouvsdg,
	author = {L. Gouveia and F. Saldanha-da-Gama},
	title = {On the Capacitated Concentator Location Problem: A Reformulation by Discretization},
	year = 	{2004}
}

@article{Murray97,
	author = {{A.T.} Murray and {R.A.} Gerrard},
	title = {Capacitated service and regional constraints in location-allocation modeling},
	journal = {Location Science},
	volume = {5},
	number = {2},
	pages = {103--118},
	year = 	{1997}
}

@techreport{Beltran04,
	author = {C. Beltran and C. Tadonki and J. Vial},
	title = {Solving the p-Median Problem with a Semi-Lagrangian Relaxation},
	institution = {University of Geneva},
	year = 	{2004}
}

@article{Drexl04,
	author = {A. Klose and A. Drexl},
	title = {Facility location models for distribution system design},
	journal = {European Journal of Operational Research},
	year = 	{2004}
}

@article{Murray02,
	author = {{T.H.} Grubesic and {A.T.} Murray},
	title = {Constructing the divide: Spatial disparities in  broadband access},
	journal = {Papers in Regional Science},
	volume = {81},
	pages = {197--221},
	year = 	{2002}
}

@article{Yaman03,
	author = {M. Labb\'e and H. Yaman},
	title = {A Note on the Projection of Polyhedra},
	journal = {Optimization Online},
	volume = {776},	
	year = 	{2003},
	note = {Optimization Online site : www.optimization-online.org}
}

@article{Yamanb,
	author = {M. Labb\'e and H. Yaman},
	title = {Solving the Uncapacitated Concentrator Location Problem with Star Routing}
}

@inbook{Gourdin02,
	author = {E. Gourdin and M. Labb\'e and H. Yaman},
	title = {Telecommunication in location},
	booktitle = {Facility location: applications and theory},
	editor = {Z. Drezner and H. Hamacher},
	publisher = {Springer, Berlin},
	year = {2003},
	pages = {275--305}
}

@article{Erle82,
	author = {{T.J.} Van Roy and D. Erlenkotter},
	title = {Dual-based procedure for dynamic facility location},
	journal = {Management Science},
	volume = {28},
	number = {10},
	year = 	{1982}
}

@article{VRoy86,
	author = {{T.J.} Van Roy and D. Erlenkotter},
	title = {A cross decomposition algorithm for capacitated facility location},
	journal = {Operations Research},
	volume = {34},
	pages = {145--163},
	year = 	{1986}
}

@article{Chri83,
	author = {N. Christofides and {J.E.} Beasley},
	title = {Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem},
	journal = {European Journal of Operational Research},
	volume = {12},
	pages = {19--28},
	year = {1983}
}

@article{Neebe83,
	author = {{A.W.} Neebe and {M.R.} Rao},
	title = {An algorithm for the fixed charge assigning users to sources problem},
	journal = {Journal of the Operational Research Society},
	volume = {34},
	number = {11},
	pages = {1107--1113},
	year = {1983}
}

@article{Klin86,
	author = {{J.G.} Klincewicz and H. Luss},
	title = {A Lagrangean Relaxation heuristic for capacitated facility location with single-source constraints},
	journal = {Journal of the Operational Research Society},
	volume = {37},
	number = {5},
	pages = {495--500},
	year = {1986}
}

@article{Ronn99,
	author = {M. R\"onnqvist and S. Tragantalerngsa and J. Holt},
	title = {A repeated matching heuristic for the single-source capacitated facility location problem},
	journal = {European Journal of Operational Research},
	volume = {116},
	pages = {51--68},
	year = {1999}
}

@article{Cort03,
	author = {{M.J.} Cortinhal and {M.E.} Captivo},
	title = {Upper and lower bounds for the single source capacitated location problem},
	journal = {European Journal of Operational Research},
	volume = {151},
	pages = {333--351},
	year = {2003}
}

@article{Holm99,
	author = {K. Holmberg and M. R\"onnqvist and D. Yuan},
	title = {An exact algorithm for the capacitated facility location problems with single sourcing},
	journal = {European Journal of Operational Research},
	volume = {113},
	pages = {544--559},
	year = {1999}
}

@article{Bram95,
	author = {{J.B.} Bramel and D. Simchi-Levi},
	title = {A location based heuristic for the delivery problem},
	journal = {Operation Research},
	volume = {43},
	pages = {649--660},
	year = {1995}
}

@article{Ambr03,
	author = {D. Ambrosino and A. Sciomachen},
	title = {Solutions of the Capacitated Concentrator Location Problem in Distribution Networks},
	journal = {AIRO Conference},
	pages = {33},
	year = {2003},
	note = {Conference Program}
}

@article{Labb03,
	author = {M. Labb\'e and H. Yaman},
	title = {Polyhedral Analysis for Concentrator Location Problem},
	journal = {Optimization Online},
	volume = {694},
	year = {2003},
	note = {Optimization Online site : www.optimization-online.org}
}

@article{Avel03,
	author = {P. Avella and A. Sassano and I. Vasil\'ev},
	title = {Computational study of large scale p-median problems},
	journal = {Optimization Online},
	volume = {625},
	year = {2003},
	note = {Optimization Online site : www.optimization-online.org}
}

@article{Gold71,
	author = {{A.J.} Goldman},
	title = {Optimal center location in simple networks},
	journal = {Transportation Science},
	volume = {5},
	pages = {212--221},
	year = {1971}
}

@article{Hoare62,
	author = {C. A. R. Hoare},
	title =  {Quicksort},
	journal = {Computer Journal},
	volume = {5},
	number = {1},
	pages = {10--15},
	year = {1962}
}

@article{PisingerWeb,
	author 	= {D. Pisinger},
	title 	= {Homepage: http://www.diku.dk/hjemmesider/ansatte/pisinger/},
	year = {Last accessed 30/09/2004}
}
@article{Lodi02a,
    author =	{A. Lodi and S. Martello and M. Monaci},
    title = 	{Two-dimensional packing problems: a survey},
    journal = 	{European Journal of Operational Research},
    volume = 	{141},
    year = 	{2002},
    pages =	{241--252}
}

@article{Lodi02b,
    author =	{A. Lodi and S. Martello and D. Vigo},
    title = 	{Recent advances on two-dimensional bin packing problems},
    journal = 	{Discrete Applied Mathematics},
    volume = 	{123},
    year = 	{2002},
    pages =	{379--396}
}

@article{Lodi04,
	author = {A. Lodi and S. Martello and D. Vigo},
	title = {Models and bounds for two dimensional packing problems},
	journal = {Journal of Combinatorial Optimization},
	volume = {8},
	year = {2004},
	pages = {363 -- 379}
}

@article{Lodi99,
    author =	{A. Lodi and S. Martello and D. Vigo},
    title = 	{Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems},
    journal = 	{INFORMS Journal on Computing},
    volume = 	{11},
    year = 	{1999},
    number = {4},
    pages =	{345--357}
}

@article{Caprara04,
    author =	{A. Caprara and M. Monaci},
    title = 	{On the two-dimensional knapsack problem},
    journal = 	{Operations Research Letters},
    volume = 	{32},
    year = 	{2004},
    pages =	{5--14}
}

@article{Martello03,
    author =	{S. Martello and P. Toth},
    title = 	{An exact algorithm for the two--constraint 0--1 knapsack problem},
    journal = 	{Operations Research},
    volume = 	{51},
	number = {5},
    year = 	{2004},
    pages =	{826--835}
}

@article{Pisinger97,
    author =	{D. Pisinger},
    title = 	{A minimal algorithm for the 0--1 knapsack problem},
    journal = 	{Operations Research},
    volume = 	{45},
    year = 	{1997},
    pages =	{758--767}
}

@article{Martello99,
    author =	{S. Martello and D. Pisinger and P.Toth},
    title = 	{Dynamic programming and strong bounds for the 0--1 knapsack problem},
    journal = 	{Management Science},
    volume = 	{45},
    number = 	{3},
    year = 	{1999},
    pages =	{414--424}
}

@unpublished{BCR04,
    author =	{A. Bettinelli and A. Ceselli and G. Righini},
    title = 	{A branch-and-price algorithm for the bi-dimensional level strip packing problem},
    note =	{Talk at AIRO-Winter '05, Cortina d'Ampezzo (Italy)},
    year = 	{2005},
    month =	{January}
}
@unpublished{CROOEBPP,
    author =	{A. Ceselli and G. Righini},
    title = 	{An optimization algorithm for the ordered open-end bin-packing problem},
    note =	{Talk presented at ECCO XVIII, Minsk},
    year = 	{2005},
    month =	{May}
}

@techreport{BCR05,
    author =	{A. Bettinelli and A. Ceselli and G. Righini},
    title = 	{A branch-and-price algorithm for the bi-dimensional level strip packing problem},
    institution = {Dipartimento di Tecnologie dell'Informazione, Universit\`a degli Studi di Milano},
    series = {Note del Polo - Ricerca},
    volume = {74},
    year = 	{2005}
}

@article{Martello00,
	author = {S. Martello and D. Pisinger and P. Toth},
	title = {New trends in exact algorithms for the 0-1 knapsack problem},
	journal = {European Journal of Operational Research},
	volume = {123},
	pages = {325--332},
	year = {2000}
}

@article{Balas80,
	author = {E. Balas and E. Zemel},
	title = {An Algorithm for Large Zero-One Knapsack Problems},
	journal = {Operations Research},
	volume =  {28},
	year = {1980},
	pages = {1130--1154}
}


@BOOK{MartelloToth,
	author = 	{S. Martello and P. Toth},
	title = 	{Knapsack problems: Algorithms and Computer Implementations},
	publisher = 	{Wiley, New York},
	year = 		{1990}

}

@article{CPS,
	author = {Eric W. Weisstein},
	title =  {Uniform Distribution: MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/UniformDistribution.html},
	year = 	{Last accessed 30/09/2004}
}

@inbook{Dyckhoff97,
	author = 	{H. Dickhoff and G. Scheithauer and J. Terno},
	editor = 	{M. Dell'Amico and F. Maffioli and S. Martello},
	title = 	{Cutting and packing},
	booktitle = 	{Annotated bibliographies in combinatorial optimization},
	publisher = 	{Wiley, New York},
	pages = 	{393--413},
	year = 		{1997}

}

@phdthesis{PisingerThesis,
  author =	 {D. Pisinger},
  title =	 {Algorithms for Knapsack Problems},
  school =	 {DIKU, University of Copenhagen},
  address =	 {Copenhagen, DK},
  year =	 {1995},
  note =	{Report 95/1}
}

@InProceedings{Cordella99,
	author =	{{L.P.} Cordella and P. Foggia and C. Sansone and M. Vento},
	title =		{Performance Evaluation of the VF Graph Matching Algorithm},
	booktitle =	{Proc. of the 10th ICIAP},
	publisher = 	{IEEE Computer Society Press},
	year =		{1999}
}

@InProceedings{Cordella01,
	author =	{{L.P.} Cordella and P. Foggia and C. Sansone and M. Vento},
	title =		{An Improved Algorithm for Matching Large Graphs},
	booktitle = 	{Proc. of the 3rd IAPR TC-15 Workshop on Graph-based Representations in Pattern Recognition},
	year =		{2001},
	address =	{Ischia, IT},
	month = 	{May}
}

@article{Ullman,
	author =	{{J.R.} Ullman},
	title =		{An algorithm for Subgraph Isomorphism},
	journal = 	{Journal of the ACM},
	volume = 	{23},
	pages = 	{31--42},
	year = 		{1976}
}

@Book{GraphTheory,
	author = 	{R. Diestel},
	title =		{Graph Theory},
	publisher =	{Springer--Verlag, New York},
	year =		{2000}
}

@Book{GareyJohnson,
	author = 	{{M.R.} Garey and D.S. Johnson},
	title = 	{Computers and Intractability: a Guide to the Theory of NP-Completeness},
	publisher = 	{W.H. Freeman, New York},
	year = 		{1979}
}

@article{Freling03,
	author =	{R. Freling and {H.E.} Romeijn and {D.R.} Morales and {A.P.M.} Wagelmans},
	title =		{A branch-and-price algorithm for the multiperiod single-sourcing problem},
	journal =	{Operations Research},
	volume = 	{51},
	number = 	{6},
	pages = 	{922--939},
	year = 		{2003}
}


@article{ANFOPU98,
	author = {R. Anbil and J. Forrest and W. Pulleyblank},
	title = {Column generation and the airline crew pairing problem},
	journal = {Documenta Mathematica},
	volume = {Extra volume ICM, III},
	year = {1998},
	pages = {677 -- 686}
}

@article{BaHaVa00,
	author = {C. Barnhart and C. Hanne and P. H. Vance},
	title = {Using branch-and-price and cut to solve origin destination integer multicommodity flow problems},
	journal = {Operations Research},
	year = {2000},
	volume = {48},
	pages = {318--326}
}

@article{BJNSV,
	author = {C. Barnhart and E. L. Johnson and G.L. Nemhauser and M. W.P. Savelsbergh and P. H. Vance},
	title = {Branch-and-price: Column generation for solving huge integer programs},
	journal = {Operations Research},
	year = {1998},
	volume = {46},
	pages = {316--329}
}

@techreport{BoGroLo01,
	author = {R. Borndorfer and M. Grotschel and A. Lobel},
	title = {Scheduling duties by adaptive column generation},
	institution = {ZIB},
	volume = {01-02},
	year = {2001}
}

@article{BoLaMe97,
	author = {J. Bourjolly and G. Laporte and H. Mercure},
	title = {A combinatorial column generation algorithm for the maximun stable set problem},
	journal = {Operations Research Letters},
	volume = {20},
	year = {1997},
	pages = {21--29}
}

@article{BrSi97,
	author = {J. Bramel and D. Simchi-Levi},
	title = {On the effectiveness of set covering formulations for the vehicle routing problem with time windows},
	journal = { Operations Research},
	year = {1997},
	volume = {45},
	pages = {295--301}
}

@inbook{BrSi02,
	author = {J. Bramel and D. Simchi-Levi},
	title = {Set-Covering-Based algorithms for the capacitated VRP},
	booktitle = { The vehicle routing problem},
	year = {2002},
	series = {Monographs on Discrete Mathematics and Applications},
	publisher = {SIAM},
	pages = {85--108}
}

@book{Mo99,
	author = {J. A. M. Brito},
	title = { Um modelo de otimiza\c{c}\~ao para dimensionamento de uma rede de telecomunica\c{c}\~oes},
	institution = {Th\`ese de ``mestrado'', COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brasil},
	year = {1999}
}

@article{BuRy99,
	author = {S.~Butt and D.M.~Ryan},
	title = {An optimal solution procedure for the multiple tour maximum collection problem using column generation},
	journal = {Computer and Operations Research},
	year = {1999},
	volume = {26},
	pages = {427-441}
}


@techreport{CeselliThesis,
	author = {A. Ceselli},
	title = {Algoritmi Branch \& Bound e Branch \& Price per il problema delle p-mediane con capacit\`a},
	institution = {DTI -- Universit\`a di Milano},
	series = {Master Thesis in Computer Science},
	year = {2002}
}


@article{ChPo99,
	author = {Z.~Chen and W.~Powell},
	title = {A column generation based descomposition algorithm for a parallel machine scheduling problem},
	journal = {Europen Journal of Operational Research},
	year = {1999},
	volume = {116},
	pages = {220-232}
}

@article{ChMiTo81,
	author = {N. Christofides and A. Mingozzi and P. Toth},
	title = {State-space relaxation procedures for the computation of bounds to routing problems},
	journal = {Networks},
	year = {1981},
	volume = {11},
	pages = {145--164}
}

@book{Ch83,
author = {V. Chv\'atal},
title = { Linear programming},
publisher = {W. H. Freeman \& C., New York / San Francisco},
year = {1983}
}


@article{CrKl94,
author = {Y. Crama and J.Van de Klundert},
title = {Approximation algorithms for integer covering problems  via greedy
 column generation},
journal = {RAIRO-Recherche Operationnelle},
volume = {28},
number = {3},
year = {1994},
pages = {283--302}
}

@article{Da65,
author = {R. Dakin},
title = {A tree search algorithm for mixed integer programming problems},
journal =  {Computer Journal},
volume = {8},
year = {1965},
pages =  {250--255}

}

@article{Da55,
author = {G.B. Dantzig},
title = {Upper bounds, secondary constraints and block triangulary in linear programming},
journal = {Econometrica},
volume = {23},
year = {1995},
pages = {174--183}
}

@book{Da63,
author = {G.B. Dantzig},
title =  {Linear programming and extensions},
publisher = {Princeton University Press, New Jersey, USA},
year = {1963}

}


@article{DaWo60,
author = {G.B. Dantzig and P. Wolfe},
title = {Decomposition principle for linear programming},
journal =  {Operations Research}, 
volume = {8},
year = {1960},
pages = {101--111}
}


@article{Car98,
author = {J.M.V. de Carvalho},
title = {Exact solution of cutting stock problems using column generation and
 branch-and-bound},
journal = {International Transactions in Operational Research},
volume = {5},
number = {1},
year = {1998},
pages = {35--43}
}


@book{De74,
author = {J. Delorme},
title =  {Contributions \`a la R\'esolution du Probl\`eme de Recouvrement:M\'ethode de Troncature},
institution = {Th\`ese de Docteur-ing\'enieur, Universit\'e Paris VI, Paris, France},
year = {1974}
}

@techreport{DeDeDuSo94,
author = {G. Desaulniers and  J. Desrosiers and Y. Dumas and M. Solomon},
title = {Daily aircraft routing and scheduling},
series = {Cahiers du Gerad},
volume = {G-94-21},
year = {1994}
}

@inbook{DeDeIoSoSoVI98,
author = {G. Desaulniers and J. Desrosiers and I. Ioachim and  M. Solomon and F. Soumis and D. Villeneuve},
title = {A unified framework for deterministic time constrained vehicle routing and 
crew scheduling problems},
booktitle = {Fleet Management and Logistics, T.G. Crainic and G. Laporte 
(eds)},
publisher = {Kluwer, Boston, MA},
pages = {57--93},
year = {1998}
}

@techreport{DeDeSo99,
author = {G. Desaulniers and J. Desrosiers and M. Solomon},
title = {Accelerating strategies in Column Generation  methods for vehicle 
routing and crew scheduling},
series = {Cahiers du Gerad},
volume = {G-99-36},
year = {1999}
}


@article{DeDeSo92,
author = {M. Desrochers and J. Desrosiers and M. Solomon},
title = {A new optimization algorithm for the vehicle routing problem with
  time windows},
journal =  {Operations Research},
volume = {40},
number = {2},
year = {1992},
pages = {342--353}
}

@article{DeSo89,
author = {J. Desrochers and F. Soumis},
title = {A column-generation approach to the urban transit crew scheduling
  problem},
journal =  {Transportation Science},
volume = {23},
year = {1989},
pages = {1--13}
}

@inbook{DeDuSoSo95,
author = {J. Desrosiers and Y. Dumas and M.N. Solomon and F. Soumis},
title = {Time constrained routing and scheduling},
booktitle = {Network Routing, volume 8 of Handbooks in Operations Research and
Management Science},
publisher = {INFORMS - North Holland},
year = {1995},
pages = {35--139}
}

@article{DeSoDe84,
author = {J. Desrosiers and F. Soumis and M. Desrochers},
title = {Routing with time-windows by column generation},
journal = {Networks},
volume = {14},
year = {1984},
pages = {545--565}
}


@article{Dr94,
author = {M. Dror},
title =  {Note on the complexity of the shortest path models for column generation in VRPTW},
journal =  {Operation Research},
volume = {42},
number = {5},
year = {1994},
pages = {977--978}
}

@article{EbToAm96,
author = {M. EbenChaime and  C. Tovey and J.C. Ammons},
title = {Circuit partitioning via set partitioning and column generation},
journal =  {Operations Research},
number = {44},
year = {1996},
pages = {65--76}
}

@techreport{FeDeGeGu03,
author = {D. Feillt and  P. Dejax and M. Gendreau and C. Gueguen},
title = {An exact algorithm for the Elementary Shortest Path Problem with Resource Constraints: Application to some Vehicle Routing Problem},
institution = {CRT},
year = {2003}
}

@article{GaSoMaDe99,
author = {M. Gamache and  F. Soumis and  G. Marquis and J. Desrosiers},
title = {A column generation approach for large-scale aircrew rostering problems},
journal =  {Operations Research},
volume  = {48},
number = {2},
year = {1992},
pages = {247--263}

}

@techreport{GeDeDeSo92,
author = {S. G\'elinas and  M. Desrochers and  J. Desrosiers and M.N. Solomon},
title =  {A new branching strategy for time constrained routing problems with application to backhauling},
institution = {GERAD},
series = {Cahiers du GERAD},
volume = {G-92-13},
year = {1992}
}

@article{GiGo61,
author = {P.C. Gilmore and  R.E. Gomory},
title = {A linear programming approach to the cutting stock problem},
journal =  {Operations Research},
volume = {9},
year = {1961},
pages = {849--859}
}

@techreport{HaJaPo98,
author = {P. Hansen and  B. Jaumard and  M.V. Poggi de Arag\ ao},
title = { Un algorithme primal de programmation lin\'eaire g\'en\'eralis\'ee
  pour les programmes mixtes},
institution =  {C. R. Acad. Sci. Paris},
series = {I},
volume = {313},
year = {1991},
pages = {557--560}
}


@techreport{JaLaRi99,
author = {B. Jaumard and  P. Labit and C. Ribeiro},
title = { A Column Generation Aproach to Cell Formation Problems in Cellular
 Manufacturing},
series = {Cahiers du Gerad},
volume = {G-99-20},
year = {1999}
}

@techreport{JaMeVo99,
author = { B. Jaumard and C. Meyer and T. Vovor},
title = {How to combine a column and row generation method with a column or
 row elimination procedures - Application to a channel Assignement problem},
series = {Cahiers du Gerad},
volume = {G-99-18},
year = {1999}

}

@techreport{JaMeVo991,
author = {B. Jaumard and  C. Meyer and T. Vovor},
title = {Column/Row Generation and Elimination Methods},
series =  {Cahiers du Gerad},
volume = {G-99-34},
year = {1999}

}


@article{JoMeNe93,
author = {E. Johnson and  A. Mehrotal and G.L. Nemhauser},
title = {Min-cut clustering},
journal =  {Mathematical Programming},
volume = {62},
year = {1993},
pages = {133--152}

}


@inbook{KroFi01,
author = {L. Kroon and M. Fischetti},
title = {Crew Scheduling for Netherlands Railways: Destination Customer},
booktitle = {Computer-Aided Scheduling of Public Transport, Lecture Notes in Economics and Mathematical Systems},
publisher = {Springer-Verlag},
pages = {181--201},
year = {2001}

}	
	
@inbook{La95,
author = {M. Labb\'e and D. Peeters and J.F. Thisse},
title = {Location on Networks},
booktitle = {Network Routing -- Handbooks in OR and MS},
volume = {8},
publisher = {Elsevier Science B.V.},
pages = {551--624},
year = {1995}
}

@book{La70,
author = {L. S. Lasdon},
title =  {Optimization Theory for Large Systems},
publisher = {Macmillan, New York, USA},
year = {1970}
}

@article{Lo98,
author = {A. Lobel},
title =  {Vehicle scheduling in public transit and lagrangean pricing},
journal = { Management Science},
number = {44},
volume = {12},
year = {1998},
pages = {1637--1649}

}

@techreport{MaMaSo02,
author = {N. Maculan and  E. Macambira and C.C. de Souza},
title = {Geometric cuts for 0-1 integer programming},
institution = {Engenharia de Sistemas, COPPE, Universidade Federal do Rio de Janeiro},
year = {2001}

}

@techreport{MaFaMi99,
author = {N. Maculan and  M. Fampa and P. Michelon},
title = {Programa\c{c}\ ao linear e inteira},
institution = {COPPE/Universidade Federal do Rio de Janeiro},
year = {1999}
}


@article{MaMiPl92,
author = {N. Maculan and P. Michelon and G. Plateau},
title = {Column generation in linear programming with bounding variable constraints and its applications in integer programming},
journal =  {Pesquisa Operacional},
volume = {12},
number = {2},
year = {1992},
pages = {45--57}
}

@inbook{MaPaBrLi02,
author = {N. Maculan and  M.M. Passini and J.A.M. Brito and A. Lisser},
title = {Column generation method for network design},
booktitle = {Transportation and Network Analysis, Current Trends},
publisher = {Kluwer Academic Press},
year = {2002},
pages = {165--179}
}

@article{MaPaBrLo03,
author = {N. Maculan and M.M. Passini and J.A.M. Brito and I. Loiseau},
title =  {Column-generation in integer linear programming},
journal = {RAIRO-Recherche Op\'erationnelle},
volume = {37},
number = {2},
year = {2003},
pages =  {67--83}
}

@article{Ma85,
author = {O. Marcotte},
title = {The cutting stock problem and integer rounding},
journal = {Mathematical Programming},
volume = {13},
year = {1985},
pages = {82--92}
}

@book{Martello90,
author = {S. Martello and P. Toth},
title =  {Knapsack problems - Algorithms and Computer Implementations},
publisher = {John Wiley \& Sons, INC., New York, USA},
year = {1990}
}

@techreport{DARiSa03,
	author = {M. Dell'Amico and G. Righini and M. Salani},
	title  = {A branch-and-price algorithm for the vehicle routing problem with simultaneous pick-up and delivery},
	volume = {51},
	series = {Note del Polo},
	institution = {Universit\`a degli Studi di Milano},
	year = {2003}
}

@article{MeTr96,
	author = {A. Mehrotra and M. Trick},
	title = {A column generation approach for graph coloring},
	journal = {INFORMS Journal on Computing},
	year = {1996},
	volume = {8},
	number = {4},
	pages = {344--353}
}

@article{Mi86,
	author = {M. Minoux},
	title = {Optimal traffic assignment in a SS/TDMA frame:  A new approach by set covering and column generation},
	journal = {RAIRO-Recherche Operationnelle},
	year = {1986},
	volume = {20},
	number = {4},
	pages = {273--286}
}

@article{Mi87,
	author = {M. Minoux},
	title = {A  class of combinatorial problems with polynomially solvable large scale set covering/partioning relaxations},
	journal = {RAIRO-Recherche Operationnelle},
	year = {1987},
	volume = {21},
	number = {2},
	pages = {105 --136}
}

@incollection{Mi90,
	author = {P.B. Mirchandani},
	title = {The p--median problem and generalizations},
	booktitle = {Discrete location theory},
	publisher = {Wiley Interscience Series},
	year = {1990},
}

@article{NePa91,
	author = {G. L. Nemhauser and S. Park},
	title = {A polyhedral approach  to edge coloring},
	journal = {Operations Research Letters},
	year = {1991},
	volume = {10},
	pages = {315-322}
}

@book{NeWo88,
	author = {G. L. Nemhauser and L. A. Wolsey},
	title = {Integer and Combinatorial Optimization},
	publisher = {John Wiley \& Sons, Inc.},
	year = {1988},
}

@book{Pa96,
	author = {M. M. Passini},
	title = {Um modelo de otimiza\c{c}\~ao combinat\'oria para o dimensionamento de uma rede urbana de telecomunica\c{c}\~oes},
	year = {1996},
	institution = {Th\`ese de ``mestrado'', COPPE, Universidade Federal do Rio de Janeiro}
}

@article{RiSo94,
	author = {C. Ribeiro and F. Soumis},
	title = {A column generation approach to the multiple-depot vehicle scheduling problem},
	journal = {Operations Research},
	year = {1994},
	volume = {42},
	pages = {41--52}
}

@article{RiMiPe89,
	author = {C. Ribeiro and M. Minoux and M.C. Penna},
	title = {An optimal column-generation-with-ranking algorithm for very large scale partitioning problems in traffic assignment},
	journal = {European Journal of Operational Research},
	year = {1989},
	volume = {41},
	pages = {232--239}
}

@incollection{RyFo81,
	author = {D.M. Ryan and B.A. Foster},
	title = { An integer programming approach to scheduling},
	booktitle = {Computer Scheduling of Public Transport Urban Passanger Vehicle and Crew Scheduling},
	editor = {},
	publisher = {North Holland},
	year = {1981}
}

@article{Sa97,
	author = {M. Savelsbergh},
	title = {A branch-and-price algorithm for the generalized assignment problem},
	journal = {Operations Research},
	year = {1997},
	volume = {46},
	pages = {831--841}
}

@book{Si03,
	author = {L. G. Simonetti},
	title = {Gera\c{c}\~ao de colunas para o problema de empacotamento de \'arvores de Steiner},
	institution = {M.Sc dissertation},
	publisher = {Universidade Federal do R\'io de Janeiro},
	year = {2003}
}

@article{SuVaWo98,
	author = {A. Sutter and F. Vanderbeck and L. Wolsey},
	title = {Optimal placement of add/drop multiplexers: Heuristic and exact algorithms},
	journal = {Operations Research},
	year = {1998},
	volume = {46},
	number = {5},
	pages = {719--728}
}


@article{Ta99,
	author = {E.D. Taillard},
	title = {A heuristic generation method for the heterogeneous fleet VRP},
	journal = {RAIRO Recherche Operationnelle},
	year = {1999},
	volume = {33},
	number = {1},
	pages = {1-14}
}

@book{ToVi02,
	author = {P. Toth and D. Vigo},
	title = {The vehicle routing problem},
	year = {2002},
	publisher = {SIAM Monographs on Discrete Mathematics and Applications}
}

@article{Va98,
	author = {P. H. Vance},
	title = {Branch-and-price algorithms for the one-dimensional cutting stock problem},
	journal = {Computational Optimization and Applications},
	year = {1998},
	volume = {9},
	pages = {211--228}
}

@article{VaBaJoNe94,
	author = {P. H. Vance and C. Barnhart and E. L. Johnson and G. L. Nemhauser},
	title = {Solving binary cutting stock problems by column generation and branch-and-bound},
	journal = {Computational Optimization and Applications},
	year = {1994},
	volume = {3},
	pages = {111--130}
}


@article{VaBaJoNe97,
	author = {P. H. Vance and C. Barnhart and E. L. Johnson and G. L. Nemhauser},
	title = {Airline crew scheduling: a new formulation and decomposition algorithm},
	journal = {Operations Research},
	year = {1997},
	volume = {45},
	number = {2},
	pages = {188--200}
}


@article{AkHoVe99,
	author = {J.M. Van~den Akker and J.A. Hoogeveen and S.L. van~de Velde},
	title = {Parallel machine scheduling by column generation},
	journal = {Operations Research},
	year = {1999},
	volume = {47},
	number = {6},
	pages = {862--872}
}

@phdthesis{Vanderbeck94,
	author = {F. Vanderbeck},
	title = {Decomposition and Column Generation for Integer Programming},
	school = {Universit\'e Catholique de Louvain, Louvain, Belgique},
	year = {1994}
}


@article{Va99,
	author = {F. Vanderbeck},
	title = {Computational study of a column generation algorithm for bin packing and cut stocking problems},
	journal = {Mathematical Programming},
	year = {1999},
	volume = {86},
	pages = {565--594}
}


@article{Va00,
	author = {F. Vanderbeck},
	title = {On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm},
	journal = {Operations Research},
	year = {2000},
	volume = {48},
	number = {1},
	pages = {111--128}
}

@article{VaWo96,
	author = {F. Vanderbeck and L. Wolsey},
	title = {An exact algorithm for IP column generation},
	journal = {Operations Research Letters},
	year = {1996},
	volume = {19},
	pages = {151--159}
}


@BOOK{Wo98,
	author = {L. Wolsey},
	title = {Integer Programming},
	year = {1998},
	publisher = {John Wiley \& Sons, INC., New York, USA}
}


@article{ANFOPU98,
	author = {R. Anbil and J. Forrest and W. Pulleyblank},
	title = {Column generation and the airline crew pairing problem},
	journal = {Documenta Mathematica},
	volume = {Extra volume ICM, III},
	year = {1998},
	pages = {677 -- 686}
}

@article{BaHaVa00,
	author = {C. Barnhart and C. Hanne and P. H. Vance},
	title = {Using branch-and-price and cut to solve origin destination integer multicommodity flow problems},
	journal = {Operations Research},
	year = {2000},
	volume = {48},
	pages = {318--326}
}

@article{BaJoNeSaVa98,
	author = {C. Barnhart and E. L. Johnson and G.L. Nemhauser and M. W.P. Savelsbergh and P. H. Vance},
	title = {Branch-and-price: Column generation for solving huge integer programs},
	journal = {Operations Research},
	year = {1998},
	volume = {46},
	pages = {316--329}
}

@techreport{BoGroLo01,
	author = {R. Borndorfer and M. Grotschel and A. Lobel},
	title = {Scheduling duties by adaptive column generation},
	institution = {ZIB},
	volume = {01-02},
	year = {2001}
}

@article{BoLaMe97,
	author = {J. Bourjolly and G. Laporte and H. Mercure},
	title = {A combinatorial column generation algorithm for the maximun stable set problem},
	journal = {Operations Research Letters},
	volume = {20},
	year = {1997},
	pages = {21--29}
}

@article{BrSi97,
	author = {J. Bramel and D. Simchi-Levi},
	title = {On the effectiveness of set covering formulations for the vehicle routing problem with time windows},
	journal = { Operations Research},
	year = {1997},
	volume = {45},
	pages = {295--301}
}

@inbook{BrSi02,
	author = {J. Bramel and D. Simchi-Levi},
	title = {Set-Covering-Based algorithms for the capacitated VRP},
	booktitle = { The vehicle routing problem},
	year = {2002},
	series = {Monographs on Discrete Mathematics and Applications},
	publisher = {SIAM},
	pages = {85--108}
}

@book{Mo99,
	author = {J. A. M. Brito},
	title = { Um modelo de otimiza\c{c}\~ao para dimensionamento de uma rede de telecomunica\c{c}\~oes},
	institution = {Th\`ese de ``mestrado'', COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brasil},
	year = {1999}
}

@article{BuRy99,
	author = {S.~Butt and D.M.~Ryan},
	title = {An optimal solution procedure for the multiple tour maximum collection problem using column generation},
	journal = {Computer and Operations Research},
	year = {1999},
	volume = {26},
	pages = {427-441}
}


@book{Ce02,
	author = {A. Ceselli},
	title = {Algoritmi Branch \& Bound e Branch \& Price per il problema delle p-mediane con capacit\`a},
	institution = {Th\`ese de ``laurea'' en Informatique, D.T.I.},
	publisher = {Universit\`a degli Studi di Milano, Milan, Italie},
	year = {2002}
}


@article{ChPo99,
	author = {Z.~Chen and W.~Powell},
	title = {A column generation based descomposition algorithm for a parallel machine scheduling problem},
	journal = {Europen Journal of Operational Research},
	year = {1999},
	volume = {116},
	pages = {220-232}
}

@book{Ch83,
author = {V. Chv\'atal},
title = { Linear programming},
publisher = {W. H. Freeman \& C., New York / San Francisco},
year = {1983}
}


@article{CrKl94,
author = {Y. Crama and J.Van de Klundert},
title = {Approximation algorithms for integer covering problems  via greedy
 column generation},
journal = {RAIRO-Recherche Operationnelle},
volume = {28},
number = {3},
year = {1994},
pages = {283--302}
}

@article{Da65,
author = {R. Dakin},
title = {A tree search algorithm for mixed integer programming problems},
journal =  {Computer Journal},
volume = {8},
year = {1965},
pages =  {250--255}

}

@article{Da55,
author = {G.B. Dantzig},
title = {Upper bounds, secondary constraints and block triangulary in linear programming},
journal = {Econometrica},
volume = {23},
year = {1995},
pages = {174--183}
}

@book{Da63,
author = {G.B. Dantzig},
title =  {Linear programming and extensions},
publisher = {Princeton University Press, New Jersey, USA},
year = {1963}

}


@article{DaWo60,
author = {G.B. Dantzig and P. Wolfe},
title = {Decomposition principle for linear programming},
journal =  {Operations Research}, 
volume = {8},
year = {1960},
pages = {101--111}
}


@book{De74,
author = {J. Delorme},
title =  {Contributions \`a la R\'esolution du Probl\`eme de Recouvrement:M\'ethode de Troncature},
institution = {Th\`ese de Docteur-ing\'enieur, Universit\'e Paris VI, Paris, France},
year = {1974}
}

@techreport{DeDeDuSo94,
author = {G. Desaulniers and  J. Desrosiers and Y. Dumas and M. Solomon},
title = {Daily aircraft routing and scheduling},
series = {Cahiers du Gerad},
volume = {G-94-21},
year = {1994}
}

@inbook{DeDeIoSoSoVI98,
author = {G. Desaulniers and J. Desrosiers and I. Ioachim and  M. Solomon and F. Soumis and D. Villeneuve},
title = {A unified framework for deterministic time constrained vehicle routing and 
crew scheduling problems},
booktitle = {Fleet Management and Logistics, T.G. Crainic and G. Laporte 
(eds)},
publisher = {Kluwer, Boston, MA},
pages = {57--93},
year = {1998}
}

@techreport{DeDeSo99,
author = {G. Desaulniers and J. Desrosiers and M. Solomon},
title = {Accelerating strategies in Column Generation  methods for vehicle 
routing and crew scheduling},
series = {Cahiers du Gerad},
volume = {G-99-36},
year = {1999}
}


@article{DeDeSo92,
author = {M. Desrochers and J. Desrosiers and M. Solomon},
title = {A new optimization algorithm for the vehicle routing problem with
  time windows},
journal =  {Operations Research},
volume = {40},
number = {2},
year = {1992},
pages = {342--353}
}

@article{DeSo89,
author = {J. Desrochers and F. Soumis},
title = {A column-generation approach to the urban transit crew scheduling
  problem},
journal =  {Transportation Science},
volume = {23},
year = {1989},
pages = {1--13}
}

@inbook{DeDuSoSo95,
author = {J. Desrosiers and Y. Dumas and M.N. Solomon and F. Soumis},
title = {Time constrained routing and scheduling},
booktitle = {Network Routing, volume 8 of Handbooks in Operations Research and
Management Science},
publisher = {INFORMS - North Holland},
year = {1995},
pages = {35--139}
}

@article{DeSoDe84,
author = {J. Desrosiers and F. Soumis and M. Desrochers},
title = {Routing with time-windows by column generation},
journal = {Networks},
volume = {14},
year = {1984},
pages = {545--565}
}


@article{Dr94,
author = {M. Dror},
title =  {Note on the complexity of the shortest path models for column generation in VRPTW},
journal =  {Operation Research},
volume = {42},
number = {5},
year = {1994},
pages = {977--978}
}

@article{EbToAm96,
author = {M. EbenChaime and  C. Tovey and J.C. Ammons},
title = {Circuit partitioning via set partitioning and column generation},
journal =  {Operations Research},
number = {44},
year = {1996},
pages = {65--76}
}

@techreport{FeDeGeGu03,
author = {D. Feillt and  P. Dejax and M. Gendreau and C. Gueguen},
title = {An exact algorithm for the Elementary Shortest Path Problem with Resource Constraints: Application to some Vehicle Routing Problem},
institution = {CRT},
year = {2003}
}

@article{GaSoMaDe99,
author = {M. Gamache and  F. Soumis and  G. Marquis and J. Desrosiers},
title = {A column generation approach for large-scale aircrew rostering problems},
journal =  {Operations Research},
volume  = {48},
number = {2},
year = {1992},
pages = {247--263}

}

@techreport{GeDeDeSo92,
author = {S. G\'elinas and  M. Desrochers and  J. Desrosiers and M.N. Solomon},
title =  {A new branching strategy for time constrained routing problems with application to backhauling},
institution = {GERAD},
series = {Cahiers du GERAD},
volume = {G-92-13},
year = {1992}
}

@article{GiGo61,
author = {P.C. Gilmore and  R.E. Gomory},
title = {A linear programming approach to the cutting stock problem},
journal =  {Operations Research},
volume = {9},
year = {1961},
pages = {849--859}
}


@article{GiGo63,
author = {P.C. Gilmore and R.E. Gomory},
title = {A linear programming approach to the cutting stock problem - part II},
journal =  {Operations Research},
volume = {11},
year = {1963},
pages =  {863--888}
}


@techreport{HaJaPo98,
author = {P. Hansen and  B. Jaumard and  M.V. Poggi de Arag\ ao},
title = { Un algorithme primal de programmation lin\'eaire g\'en\'eralis\'ee
  pour les programmes mixtes},
institution =  {C. R. Acad. Sci. Paris},
series = {I},
volume = {313},
year = {1991},
pages = {557--560}
}


@techreport{JaLaRi99,
author = {B. Jaumard and  P. Labit and C. Ribeiro},
title = { A Column Generation Aproach to Cell Formation Problems in Cellular
 Manufacturing},
series = {Cahiers du Gerad},
volume = {G-99-20},
year = {1999}
}

@techreport{JaMeVo99,
author = { B. Jaumard and C. Meyer and T. Vovor},
title = {How to combine a column and row generation method with a column or
 row elimination procedures - Application to a channel Assignement problem},
series = {Cahiers du Gerad},
volume = {G-99-18},
year = {1999}

}

@techreport{JaMeVo991,
author = {B. Jaumard and  C. Meyer and T. Vovor},
title = {Column/Row Generation and Elimination Methods},
series =  {Cahiers du Gerad},
volume = {G-99-34},
year = {1999}

}


@article{JoMeNe93,
author = {E. Johnson and  A. Mehrotal and G.L. Nemhauser},
title = {Min-cut clustering},
journal =  {Mathematical Programming},
volume = {62},
year = {1993},
pages = {133--152}

}


@inbook{KroFi01,
author = {L. Kroon and M. Fischetti},
title = {Crew Scheduling for Netherlands Railways: Destination Customer},
booktitle = {Computer-Aided Scheduling of Public Transport, Lecture Notes in Economics and Mathematical Systems},
publisher = {Springer-Verlag},
pages = {181--201},
year = {2001}

}	
	
@inbook{La95,
author = {M. Labb\'e and D. Peeters and J.F. Thisse},
title = {Location on Networks},
booktitle = {Network Routing -- Handbooks in OR and MS},
volume = {8},
publisher = {Elsevier Science B.V.},
pages = {551--624},
year = {1995}
}

@book{La70,
author = {L. S. Lasdon},
title =  {Optimization Theory for Large Systems},
publisher = {Macmillan, New York, USA},
year = {1970}
}

@article{Lo98,
author = {A. Lobel},
title =  {Vehicle scheduling in public transit and lagrangean pricing},
journal = { Management Science},
number = {44},
volume = {12},
year = {1998},
pages = {1637--1649}

}

@techreport{MaMaSo02,
author = {N. Maculan and  E. Macambira and C.C. de Souza},
title = {Geometric cuts for 0-1 integer programming},
institution = {Engenharia de Sistemas, COPPE, Universidade Federal do Rio de Janeiro},
year = {2001}

}

@techreport{MaFaMi99,
author = {N. Maculan and  M. Fampa and P. Michelon},
title = {Programa\c{c}\ ao linear e inteira},
institution = {COPPE/Universidade Federal do Rio de Janeiro},
year = {1999}
}


@article{MaMiPl92,
author = {N. Maculan and P. Michelon and G. Plateau},
title = {Column generation in linear programming with bounding variable constraints and its applications in integer programming},
journal =  {Pesquisa Operacional},
volume = {12},
number = {2},
year = {1992},
pages = {45--57}
}

@inbook{MaPaBrLi02,
author = {N. Maculan and  M.M. Passini and J.A.M. Brito and A. Lisser},
title = {Column generation method for network design},
booktitle = {Transportation and Network Analysis, Current Trends},
publisher = {Kluwer Academic Press},
year = {2002},
pages = {165--179}
}

@article{MaPaBrLo03,
author = {N. Maculan and M.M. Passini and J.A.M. Brito and I. Loiseau},
title =  {Column-generation in integer linear programming},
journal = {RAIRO-Recherche Op\'erationnelle},
volume = {37},
number = {2},
year = {2003},
pages =  {67--83}
}

@article{Ma85,
author = {O. Marcotte},
title = {The cutting stock problem and integer rounding},
journal = {Mathematical Programming},
volume = {13},
year = {1985},
pages = {82--92}
}

@book{Martello90,
author = {S. Martello and P. Toth},
title =  {Knapsack problems - Algorithms and Computer Implementations},
publisher = {John Wiley \& Sons, INC., New York, USA},
year = {1990}
}

@techreport{DARiSa03,
	author = {M. Dell'Amico and G. Righini and M. Salani},
	title  = {A branch-and-price algorithm for the vehicle routing problem with simultaneous pick-up and delivery},
	volume = {51},
	series = {Note del Polo},
	institution = {Universit\`a degli Studi di Milano},
	year = {2003}
}

@article{MeTr96,
	author = {A. Mehrotra and M. Trick},
	title = {A column generation approach for graph coloring},
	journal = {INFORMS Journal on Computing},
	year = {1996},
	volume = {8},
	number = {4},
	pages = {344--353}
}

@article{Mi86,
	author = {M. Minoux},
	title = {Optimal traffic assignment in a SS/TDMA frame:  A new approach by set covering and column generation},
	journal = {RAIRO-Recherche Operationnelle},
	year = {1986},
	volume = {20},
	number = {4},
	pages = {273--286}
}

@article{Mi87,
	author = {M. Minoux},
	title = {A  class of combinatorial problems with polynomially solvable large scale set covering/partioning relaxations},
	journal = {RAIRO-Recherche Operationnelle},
	year = {1987},
	volume = {21},
	number = {2},
	pages = {105 --136}
}

@incollection{Mi90,
	author = {P.B. Mirchandani},
	title = {The p--median problem and generalizations},
	booktitle = {Discrete location theory},
	publisher = {Wiley Interscience Series},
	year = {1990},
}

@article{NePa91,
	author = {G. L. Nemhauser and S. Park},
	title = {A polyhedral approach  to edge coloring},
	journal = {Operations Research Letters},
	year = {1991},
	volume = {10},
	pages = {315-322}
}

@book{NeWo88,
	author = {G. L. Nemhauser and L. A. Wolsey},
	title = {Integer and Combinatorial Optimization},
	publisher = {John Wiley \& Sons, Inc.},
	year = {1988},
}

@book{Pa96,
	author = {M. M. Passini},
	title = {Um modelo de otimiza\c{c}\~ao combinat\'oria para o dimensionamento de uma rede urbana de telecomunica\c{c}\~oes},
	year = {1996},
	institution = {Th\`ese de ``mestrado'', COPPE, Universidade Federal do Rio de Janeiro}
}

@article{RiSo94,
	author = {C. Ribeiro and F. Soumis},
	title = {A column generation approach to the multiple-depot vehicle scheduling problem},
	journal = {Operations Research},
	year = {1994},
	volume = {42},
	pages = {41--52}
}

@article{RiMiPe89,
	author = {C. Ribeiro and M. Minoux and M.C. Penna},
	title = {An optimal column-generation-with-ranking algorithm for very large scale partitioning problems in traffic assignment},
	journal = {European Journal of Operational Research},
	year = {1989},
	volume = {41},
	pages = {232--239}
}

@incollection{RyFo81_2,
	author = {D.M. Ryan and B.A. Foster},
	title = { An integer programming approach to scheduling},
	booktitle = {Computer Scheduling of Public Transport Urban Passanger Vehicle and Crew Scheduling},
	editor = {},
	publisher = {North Holland},
	year = {1981}
}

@article{Sa97,
	author = {M. Savelsbergh},
	title = {A branch-and-price algorithm for the generalized assignment problem},
	journal = {Operations Research},
	year = {1997},
	volume = {46},
	pages = {831--841}
}

@book{Si03,
	author = {L. G. Simonetti},
	title = {Gera\c{c}\~ao de colunas para o problema de empacotamento de \'arvores de Steiner},
	institution = {M.Sc dissertation},
	publisher = {Universidade Federal do R\'io de Janeiro},
	year = {2003}
}

@article{SuVaWo98,
	author = {A. Sutter and F. Vanderbeck and L. Wolsey},
	title = {Optimal placement of add/drop multiplexers: Heuristic and exact algorithms},
	journal = {Operations Research},
	year = {1998},
	volume = {46},
	number = {5},
	pages = {719--728}
}


@article{Ta99,
	author = {E.D. Taillard},
	title = {A heuristic generation method for the heterogeneous fleet VRP},
	journal = {RAIRO Recherche Operationnelle},
	year = {1999},
	volume = {33},
	number = {1},
	pages = {1-14}
}

@book{ToVi02,
	author = {P. Toth and D. Vigo},
	title = {The vehicle routing problem},
	year = {2002},
	publisher = {SIAM Monographs on Discrete Mathematics and Applications}
}

@article{VaBaJoNe97,
	author = {P. H. Vance and C. Barnhart and E. L. Johnson and G. L. Nemhauser},
	title = {Airline crew scheduling: a new formulation and decomposition algorithm},
	journal = {Operations Research},
	year = {1997},
	volume = {45},
	number = {2},
	pages = {188--200}
}


@article{AkHoVe99,
	author = {J.M. Van~den Akker and J.A. Hoogeveen and S.L. van~de Velde},
	title = {Parallel machine scheduling by column generation},
	journal = {Operations Research},
	year = {1999},
	volume = {47},
	number = {6},
	pages = {862--872}
}

@phdthesis{Va94,
	author = {F. Vanderbeck},
	title = {Decomposition and Column Generation for Integer Programming},
	school = {Doctorat en sciences appliqu\'ees, Universit\'e Catholique de Louvain, Louvain, Belgique},
	year = {1994}
}


@article{Va99,
	author = {F. Vanderbeck},
	title = {Computational study of a column generation algorithm for bin packing and cut stocking problems},
	journal = {Mathematical Programming},
	year = {1999},
	volume = {86},
	pages = {565--594}
}


@article{Va00,
	author = {F. Vanderbeck},
	title = {On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm},
	journal = {Operations Research},
	year = {2000},
	volume = {48},
	number = {1},
	pages = {111--128}
}

@article{VaWo96,
	author = {F. Vanderbeck and L. Wolsey},
	title = {An exact algorithm for IP column generation},
	journal = {Operations Research Letters},
	year = {1996},
	volume = {19},
	pages = {151--159}
}

@article{Johnson00,
	author =	{E.L. Johnson and  G.L. Nemhauser and M.W.P. Savelsbergh},
       	year =		{2000},
      	title = 	{Progress in Linear Programming Based Branch-and-Bound Algorithms: An Exposition},
	journal = 	{INFORMS Journal on Computing},
       	volume =		{12} 
}

@techreport{Luebbecke05,
	author = 	{J. Desrosiers and M.E. L\"ubbecke},
	title = 	{Selected topics in column generation},
	series =	{Les Cahiers de GERAD},
       volume =		{G-2002-64},
       institution = 	{HEC Montreal},
       year = 		{2002}
}

@book{LuebbeckeLibro,
	editor = {G. Desaulniers and J. Desrosiers and M.M. Solomon},
       title = {Column Generation},
      publisher = {Springer},
     year = 	{2005}
}

@manual{CPLEX,
	author = {CPLEX 8.1},
	title =	{ILOG: Homepage http://www.ilog.com},
	institution = {ILOG},
	year = {Last access, 15/09/2005}
}
@manual{XPRESS,
	author = {Xpress--Optimizer},
	title 	= {Dash Optimization: Homepage http://www.dashoptimization.com},
	institution = {Dash Optimization},
	year = {Last accessed 15/09/2005}
}
@manual{GLPK,
	author = {GNU Linear Programming Kit},
	title 	= {Homepage http://www.gnu.org/software/glpk/},
	institution = {Free software foundation},
	year = {Last accessed 15/09/2005}
}

@book{Maryan,
	author = {R.K. Martin},
	title = {Large scale linear and integer optimization},
	publisher = {Kluwer academic},
	year = {1998}
}

@article{Frangioni05,
	author = {A. Frangioni},
	title = {About Lagrangian Methods in Integer Optimization},
	journal = {Annals of Operations Research},
       volume = {139},
       pages = {163 -- 193},
       year = {2005}
}

@article{CR05,
       author = {A. Ceselli and G. Righini},
      year = {2005},
      title = {A branch-and-price algorithm for the capacitated p-median problem},
      journal = {Networks},
     volume = {45},
    number = {3},
    pages = {125 -- 142}
}

@techreport{CRMGAP,
	author = {A. Ceselli  and G. Righini},
	year = {2004},
	title = {A branch-and-price algorithm for the multilevel generalized assignment problem},
	institution = {DTI -- Universit\`a di Milano},
	series = {Note del Polo -- Ricerca},
	volume = {62}
}

@article{CRPKP,
       author = {A. Ceselli and G. Righini},
       year = {2005},
       title = {An optimization algorithm for a penalized knapsack problem},
       journal = {Operations Research Letters},
       volume = {in press, available online}
}

@techreport{CRAOR,
       author = {A. Ceselli and F. Liberatore and G. Righini},
       year = {2005},
       title = {A computational evaluation of a general branch-and-price framework for capacitated network location problems},
       series = {Note del Polo -- Ricerca},
       institution = {DTI -- Univerist\`a di Milano},
       volume = {76}
}

@techreport{Frangioni04,
	author = {{H.} {Ben Amor} and J. Desrosiers and A. Frangioni},
	title = {Stabilization in Column Generation},
	series = {Les Cahiers du Gerad},
	volume = {G-2004-75},
	year = {2004}
}

@article{BarahonaVol,
     author = {F. Barahona and R. Anbil},
     title = {The volume algorithm: Producing primal solutions with a subgradient method},
     journal = {Mathematical Programming A},
     volume = {87},
     year = {2000}
}

@article{MaculanVol,
      author = {L. Bahiense and N. Maculan and C.A. Sagastiz\'abal},
      title = {The volume algorithm revisited. Relation with bundle methods},
      journal = {Mathematical Programming},
     volume = {94},
     number = {1},
     pages = {41--69},
    year = {2002}
} 

@article{PisingerHK,
      author = {D. Pisinger},
     title = {Where are the hard knapsack problems?},
    journal = {Computers and Operations Research},
   volume = {32},
  pages = {2271-2284},
 year = {2005}
}

@article{InteriorPoint,
      author = {L.M. Rousseau and M. Gendreau and D. Feillet},
     title = {Interior Point Stabilization for Column Generation},
     year = {2007},
	journal  = {Operations Research Letters},
	volume = {35},
	number = {5},
	pages = {660--668}
	
}
%	institution = {Laboratoire Informatique d'Avignon},
%       note = {submitted to Operations Research Letters}

@article{StabilizedColumnGeneration,
       author = {O. du Merle and D. Villeneuve and J. Desrosiers and P. Hansen},
       title = {Stabilized Column Generation},
       journal = {Discrete Mathematics},
      volume = {194},
      pages = {229-237},
     year = {1999}
} 

@inproceedings{Sigurd04,
	author = {M. Sigurd},
       	title = {Stabilizing Column Generation},
       	booktitle = {International Symposium on Mathematical Programming},
       address = {Copenhagen},
       year = {2003},
       month = {August}
}

@inproceedings{LorenaSurrogate,
       author = {E.L.F. Senne and L.A.N. Lorena},
      title = {Stabilizing column generation using Lagrangean/surrogate relaxation: an application to p-median location problems},
      booktitle = {Proceedings of the EURO 2001 conference},
     address = {Erasmus University Rotterdam},
    month = {July},
   year = {2001}
}


@article{Fekete,
	author = "S. P. Fekete and J. Schepers",
	title =  "A combinatorial characterization of higher-dimensional orthogonal packing",
	journal = "Mathematics of Operations Research",
	volume =  "29",
	issue =   "2",
	pages =   "353--368",
	year =    "2004"
}
@article{FeketeII,
	author = "S.~P. Fekete and J.~Schepers",
	title =  "A general framework for bounds for higher-dimensional orthogonal packing problems",
	journal = "Mathematical Methods of Operations Research",
	volume =  "60",
	number =   "2",
	pages =   "311--329",
	year =    "2004"
}

@techreport{FeketeIII,
	author = "S.~P. Fekete and J.~Schepers",
	title =  "On higher-dimensional packing III: Exact algorithms",
	number = "97--290",
	year =    "1997",
	series =  "Angewandte Mathematik und Informatik",
	school =  {Universit\"at zu K\"oln}
}

@article{FPTAS2lsp,
	author = {C. Kenyon and E. R\'emila},
       title = {A near-optimal solution to a two-dimensional cutting stock problem},
      journal = {Mathematics of Operations Research},
     volume = {25},
    year = {2000},
    pages = {645--656}
}

@article{SA2lsp,
	author =  {K. Dowsland},
       	title = {Some experiments with simulated annealing techniques for packing problems},
       journal = {European Journal of Opeerations Research},
      volume = {68},
     year = {1993},
     pages = {389--399}
}

@article{GA2lsp,
       author = {S. Jacobs},
      title = {On genetic algorithms for the packing of polygons},
     journal = {European Journal of Operations Research},
    	volume = {88},
       	year = {1996},
	pages = {165--181}
}

@article{BB2lsp,
	author = {S. Martello and M. Monaci and D. Vigo},
       title = {An exact approach to the strip-packing problem},
      journal = {INFORMS journal on computing},
     volume = {15},
    year = {2003},
   pages = {310--319}
}

@article{BerkeyW87,
       author = {J.O. Berkey and P. Y. Wang},
      title = {Two-dimensional finite bin-packing algorithms},
     journal = {Journal of the Operational Research Society},
    volume = {38},
   year = {1987},
   pages = {423--429}
}

@inbook{CGJ96,
	author = {{E.G.} {Coffman Jr.} and  M. R. Garey and D. S. Johnson},
	title = {Approximation algorithms for bin packing: a survey},
	booktitle = {Approximation algorithms for NP-hard problems},
       editor = {D. Hochbaum},
      publisher = {PWS Publishing Company},
     	address = {Boston, U.S.A.},
       year = {1996}
}

@article{LDY01,
	author = {J.Y.T. Leung and M. Dror and G. H. Young},
	title = {A note on an open-end bin packing problem},
	journal = {Journal of Scheduling},
       volume = {4},
      year = {2001},
      pages = {201--207}
}

@article{YL03,
	author = {J. Yang and  J. Y.T. Leung},
	title = {The ordered open-end bin-packing problem}, 
	journal = {Operations Research},
       volume = {51},
	year = {2003},
       	pages = {759--770}
}

@book{KnapsackBook,
       author = {H. Kellerer and U. Pferschy and D. Pisinger},
      title = {Knapsack Problems},
     publisher = {Springer Verlag},
    year = {2005}
}

@article{French02,
       author = {A.P. French and J.M. Wilson},
       year = {2002},
       title = {Heuristic solution methods for the multilevel generalized assignment problem},
       journal = {Journal of Heuristics},
      volume = {8},
     pages = {143--153}
}

@article{Glover79,
       author = {F. Glover and J. Hultz and D. Klingman},
       year = {1979},
       title = {Improved computer-based planning techniques. Part II.},
       journal = {Interfaces},
      volume = {9},
      number = {4},
      pages = {12--20}
}

@article{Laguna95,
	author = {M. Laguna and J.P. Kelly and J.L. Gonzalez-Velarde and F. Glover},
	year = {1995},
	title = {Tabu search for the multilevel generalized assignment problem},
	journal = {European Journal of Operational Research},
       volume = {82},
       pages = {176--189}
}

@article{LandDoig,
	author = {A.H. Land and A.G. Doig},
	year = {1960},
	title = {An automatic method for solving discrete programming problems},
	journal = {Econometrica},
	volume = {28},
	pages = {497--520}
}

@article{Nauss03,
	author = {R.M. Nauss},
       year = {2003},
	title = {Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach},
	journal = {INFORMS Journal on Computing},
       volume = {15},
       number = {3},
       pages = {249--266}
}

@article{OsoLag03,
	author = {M.A. Osorio and M. Laguna},
	year = {2003},
	title = {Logic cuts for multilevel generalized assignment problems},
	journal = {European Journal of Operational Research},
       volume = {151},
       pages = {238--246}
}

@article{Yagiura98,
       author = {M. Yagiura and  T. Yamaguchi and T. Ibaraki},
      year = {1998},
      title = {A variable depth search algorithm with branching search for the generalized assignment problem},
      journal = {Optimization methods and software},
      volume = {10},
     pages = {419--441}
}

@article{Geoffrion74,
	author = {A.M. Geoffrion},
	title = {Lagrangean relaxation for integer programming},
	journal = {Mathematical programming studies},
	year = {1974},
	volume = {2},
	pages = {82--114}
}

@article{Washer06,
	author = {G. W\"asher and H. Haussner and H. Schumann},
	year = {2006},
	title = {An improved typology of cutting and packing problems},
	journal = {European Journal of Operational Research},
	volume = {forthcoming}
}

@article{AlvCar06,
	author = {C. Alves, J. M. Valério de Carvalho},
	year = {2006},
	title = {Accelerating column generation for variable sized bin-packing problems},
	journal = {European Journal of Operational Research},
	volume = {forthcoming}
}

@article{AlvCar06_2,
	author = {C. Alves, J. M. Valério de Carvalho},
	year = {2006},
	title = {A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem},
	journal = {Computer and Operations Research},
	volume = {forthcoming}
}

@book{MT90,
	author = {S. Martello, P. Toth},
	year = {1990},
	title = {Knapsack problems: algorithms and computer implementations},
	publisher = {John Wiley and Sons}
}

@article{Dyckhoff90,
	author = {H. Dyckhoff},
	year = {1990},
	title = {A typology of cutting and packing problems},
	journal = {European Journal of Operational Research},
	volume = {44},
	pages = {145--159}
}

@article{FriLan86,
	author = {D. K. Friesen, M. A. Langston},
	year = {1986},
	title = {Variable sized bin packing},
	journal = {SIAM Journal og Computing},
	volume = {15},
	pages = {222-30}
}

@article{KanPar03,
	author = {J. Kang, S. Park},
	year = {2003},
	title = {Algorithms for the variable sized bin packing},
	journal = {European Journal of Operational Research},
	volume = {147},
	pages = {365-72}
}

@PHDTHESIS{Monaci02,
	author = {M. Monaci},
	year = {2002},
	title = {Algorithms for packing and scheduling problems},
	school = {Università di Bologna},
}


@article{BelSch02,
	author = {G. Belov, G. Scheithauer},
	year = {2002},
	title = {A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths},
	journal = {European Journal of Operational Research},
	volume = {141},
	pages = {274-94}
}

@article{PisSig05,
	author = {D. Pisinger, M. Sigurd},
	year = {2005},
	title = {The two dimensional bin packing problem with variable bin sizes and costs},
	journal = {Discrete Optimization},
	volume = {2},
	pages = {154-67}
}

@article{CorGouSal06,
	author = {I. Correia, L. Gouveia, F. Saldanha-da-Gama},
	year = {2006},
	title = {Solving the variable size bin packing problem with discretized formulations},
	journal = {Computers and Operations Research},
	volume = {}
}

@article{Murgolo87,
	author = {F. D. Murgolo},
	year = {1987},
	title = {An efficient approximation scheme for variable-sized bin packing},
	journal = {SIAM Journal on Computing},
	volume = {16},
	pages = {149-161}
}

@article{ChuLa01,
	author = {C. Chu, R. La},
	year = {2001},
	title = {Variable-sized bin packing: tight absolute worst-case performance ratios for four approximation algorithms},
	journal = {SIAM Journal on Computing},
	volume = {16},
	pages = {149-161}
}

@article{Gouveia95,
	author = {L. Gouveia},
	year = {1995},
	title = {A 2n constraint formulation for the capacitated minimal spanning tree problem},
	journal = {Operations Research},
	volume = {43},
	pages = {130-141}
}

@article{Roodman86,
	author = {G. Roodman},
	year = {1986},
	title = {Near optimal solution to one-dimensional cutting stock problem},
	journal = {Computers and Operations Research},
	volume = {13},
	pages = {713-719}
}

@article{Holthaus02,
	author = {O. Holthaus},
	year = {2002},
	title = {Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths},
	journal = {European Journal of Operational Research},
	volume = {141},
	pages = {295-312}
}

@article{CofGarJoh87,
	author = {E. G. Coffman, M. R. Garey, D. S. Johnson},
	year = {1987},
	title = {Bin packing with divisible item sizes},
	journal = {Journal of Complexity},
	volume = {3},
	pages = {406-28}
}

@article{SchKleJur97,
	author = {A. Scholl, R. Klein, C. Jurgens},
	year = {1997},
	title = {Bison: a fast hybrid procedure for exactly solving the one-dimensional bion packing problem},
	journal = {Comput. Oper. Res},
	volume = {24},
	pages = {627-645}
}

@article{Marcotte85,
	author = {O. Marcotte},
	year = {1985},
	title = {Cutting Stock Problem and Integer Rounding},
	journal = {Math. Program.},
	volume = {33},
	pages = {89-92}
}

@article{Goulimis90,
	author = {C. N. Goulimis},
	year = {1990},
	title = {Optimal Solutions for the Cutting Stock Problem},
	journal = {European Journal of Operational Research},
	volume = {44},
	pages = {197-208}
}

@article{SchTer95,
	author = {G. Scheithauer, J. Terno},
	year = {1995},
	title = {A Branch-and-Bound Algorithm for Solving One-dimensional Cutting Stock Problems},
	journal = {Appl. Math.},
	volume = {23},
	pages = {151-167}
}

@article{1067219,
 author = {Jos\&\#233; M. Val\&\#233;rio de Carvalho},
 title = {Using Extra Dual Cuts to Accelerate Column Generation},
 journal = {INFORMS J. on Computing},
 volume = {17},
 number = {2},
 year = {2005},
 issn = {1526-5528},
 pages = {175--182},
 doi = {http://dx.doi.org/10.1287/ijoc.1030.0060},
 publisher = {INFORMS},
 address = {Institute for Operations Research and the Management Sciences (INFORMS), Linthicum, Maryland, USA},
 }

@article{Walkowiak05,
	author = {R. Walkowiak},
	year = {2005},
	title = {Shipment cost optimization},
	journal = {ECCO VXIII - Minsk},
}

@TechReport{Achterberg2004TR,
  author       = "T. Achterberg",
  title        = "{SCIP} - a framework to integrate Constraint and Mixed Integer Programming",
  institution  = "Zuse Institute Berlin",
  number       = "04-19",
  year         = "2004",
  note         = "\url{http://www.zib.de/Publications/abstracts/ZR-04-19/}",
}

@article{CapTru05,
	author = {P. Cappanera and M. Trubian},
	year = {2005},
	title = {A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem},
	journal = {INFORMS Journal On Computing},
	volume = {17},
	pages = {82-98}
}

@article{LiuShen99,
	author = {F.H. Liu and S.Y. Shen},
	year = {1999},
	title = {The fleet size and mix vehicle routing problem with time windows},
	journal = {Journal of the Operational Research Society},
	volume = {50},
	pages = {721-732}
}

@article{Sol87,
	author = {M.M. Solomon},
	year = {1987},
	title = {Algotithms for the vehicle routing and scheduling problems with time windows constraints},
	journal = {Operations Research},
	volume = {35},
	pages = {254-265}	
}

@article{BeFa07,
	author = {P.P. Belfiore and L.P.L. Fávero},
	year = {2007},
	title = {Scatter search for the fleet size and mix vehicle routing problem with time windows},
	journal = {Central European Journal of Operations Research},
	volume = {15},
	pages = {351-368}
}

@article{DuJa02,
	author= {Dullaert, W. and Janssens, G.K. and Sorensen, K. and Vernimmen, B.},
	year = {2002},
	title = {New heuristics for the fleet size and mix vehicle routing problem with time windows},
	journal = {Journal of the Operational Research Society},
	volume = {53},
	pages = {1232-1238}
}

@article{GoAs84,
	author = {B.L. Golden and A. Assad and L. Levy and F. Gheysens},
	year = {1984},
	title = {The fleet size and mix vehicle routing problem},
	journal = {Computers and Operations Research},
	volume = {11},
	pages = {49-65}
}

@article{BaMi08,
	author = {R. Baldacci and A. Mingozzi},
	year = {2008},
	title = {A unified exact method for solving different classes of vehicle routing problems},
	journal = {Mathematical Programming},
	volume = {to appear}
}

@article{DuDe94,
	author = {Dumas, Y. and Desrosiers, J. and Gélinas, E. and Solomon, M. M. },
	year = {1994},
	title = { An optimal algorithm for the travelling salesman problem with time windows },
	journal = {Operations Research},
	volume = {42},
	pages = {626-642}
}

@article{KoDe99,
	author = {Kohl, N. and Desrosiers, J. and Madsen, O.B.G. and Solomon, M.M. and Soumis, F.},
	year = {1999},
	title = { 2-path cuts for the vehicle routing problem with time windows },
	journal = {Transportation science},
	volume = {33},
	pages = {101-116}
}

@article{LaNoDe85,
	author = {G. Laporte and Y. Norbert and M. Desrochers},
	year = {1985},
	title = { Optimal routing under capacity and distance restrictions },
	journal = {Operations Research},
	volume = {33},
	pages = {1050-1073}
}

@article{BeCh89, 
	author = {Beasley J.E. and Christofides N.},
	year = {1989},
	title = {An algorithm for the resource constrained shortest path problem},
	journal = {Networks},
	volume = {19},
	pages = {379-394}
}

@article{FeDeGeGu04, 
	author = {D. Feillet and P. Dejax and M. Gendreau and C. Gueguen},
	year = {2004},
	title = {An exact algorithm for the elementary shortest path with resource constraints: application to some vehicle routing problems},
	journal = {Networks},
	volume = {44},
	pages = {216-229}
}

@PHDTHESIS{SalPhD,
	author = {Salani, M.},
	title = {Branch-and-Price Algorithms for Vehicle Routing Problems},
	school = {Università degli Studi di Milano},
	year = {2006}
}

@article{SaRi08,
	author = {G. Righini and M. Salani},
	title = {New dynamic programming algorithms for the resource constrained elementary shortest path problem},
	journal = {Networks},
	volume = {51},
	pages = {155-170},
	year = {2008}
}

@book{ GoRaWa08,
	editor = {Golden, B. and Raghavan, S. and Wasil, Edward},
	title = {The Vehicle Routing Problem: Latest Advances and New Challenges},
	publisher = {Springer},
	year = {2008}
}

@article{PoHaDoRe04,
	author = {M. Polacek and Richard F. Hartl and K. Doerner and M. Reimann},
	title = {A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows},
	journal = {Journal of Heuristics},
	volume = {10},
	pages = {613-627},
	year = {2004}
}

@article{DoCe07,
	author = {Dondo, R. and Cerd\'a, J.},
	title = {A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows},
	journal = {European Journal of Operational Research},
	volume = {176},
	pages = {1478-1507},
	year = {2007}
}

@article{DoCe09,
	author = {Dondo, R. and Cerd\'a, J.},
	title = {A hybrid local improvement algorithm for large-scale multi-depot vehicle routing problems with time windows},
	journal = {Computers \& Chemical Engineering},
	year = {to appear}
}

@article{ChMiTo81_2,
	author = {Christofides, N. and Mingozzi, A. and Toth, P.},
	title = {Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxation},
	journal = {Math. Program.},
	volume = {10}, 
	pages = {255-280},
	year = {1981}
}

@article{BaChMi07,
	author = {R. Baldacci and N. Christofides and A. Mingozzi},
	title = {An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts},
	journal = {Math. Prog.},
	volume = {115},
	pages = {351-385},
	year = {2007}
}

@article{CoLaMe01,
	author = {J.F. Cordeau and G. Laporte and A. Mercier},
	title = {A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows},
	journal = {Journal of the Operational Research Society},
	volume = {52},
	pages = {928-936},
	year = {2001}
}


@article{SaRi06,
	author = {Righini, G. and Salani, M.},
	title = {Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints},
	journal = {Discrete Optimization},
	volume = {30},
	number = {3},
	pages = {255-273},
	year = {2006}
}

@article{Dror94,
	author = {Dror, M.},
	title = {Note on the complexity of the shortest path models for column generation in VRPTW},
	journal = {Operations Research},
	volume = {42},
	year = {1994},
	pages = {977 -- 978}
}

@PhdThesis{SCIP,
  author = 	 "T. Achterberg",
  title = 	 "Constraint {I}nteger {P}rogramming",
  school = 	 "Technische Universit{\"a}t Berlin",
  year = 	 "2007"
}
 % note = "http://opus.kobv.de/tuberlin/volltexte/2007/1611/",


@techreport{specint,
	title = {SPEC CINT 2006},
	institution = {Standard Performance Evaluation Corporation},
	year = {2006},
	note = {available at http://www.spec.org/cpu2006/CINT2006/}
	
}

@techreport{LINPACK09,
	author = {{J.J.} Dongarra},
	title = {Performance of various computers using standard linear equations software},
	institution = {University of Tennessee},
	year = {2009},
	note = {available at http://www.netlib.org/benchmark/performance.ps}
}

@article{Santos2008,

title = "Implementing a multi-vehicle multi-route spatial decision support system for efficient trash collection in Portugal",

journal = "Transportation Research Part A: Policy and Practice",

volume = "42",

number = "6",

pages = "922 - 934",

year = "2008",

note = "",

issn = "0965-8564",

doi = "DOI: 10.1016/j.tra.2007.08.009",

url = "http://www.sciencedirect.com/science/article/B6VG7-4S094WG-1/2/7944bbb85dadc544a5b85c78cd6ffcc2",

author = "L. Santos and J. Coutinho-Rodrigues and J. R. Current",

keywords = "Vehicle routing",

keywords = "Spatial decision support systems",

keywords = "Geographical information systems",

keywords = "Heuristics"

}

@article{Prindezis2005,

title = "An internet-based logistics management system for enterprise chains",

journal = "Journal of Food Engineering",

volume = "70",

number = "3",

pages = "373 - 381",

year = "2005",

author = "N. Prindezis and C.T. Kiranoudis",
}

@article{CeRiSa09,

	author = {A. Ceselli and G. Righini and M. Salani},
	title = {A Column Generation Algorithm for a Rich Vehicle-Routing Problem},
	journal = {Transportation Science},
	volume = {43},
	number = {1},
	pages = {56-69},
	year = {2009}
}

@book{CGBook,
	author = {G. Desaulniers and J. Desrosiers and M.M. Solomon},
	title = {Column Generation},
	publisher = {Springer},
	year = {2005}

}

@misc{BeCeRi09,
	author = {A. Bettinelli and A. Ceselli and G. Righini},
	title = {A branch-and-price algorithm for the multi-depot heterogeneous fleet vehicle routing
                            problem with time windows},
       	howpublished = {AIRO Winter},
       	address = {Cortina d'Ampezzo},
       	year = {2009},
       	month = {January}
}

@article{DellAmico07,

	author = {M. Dell'Amico and M. Monaci and C. Pagani and D. Vigo},
	title = {Heuristic approaches for the fleet size and mix vehicle routing problem with time windows},
	journal = {Transportation Science},
	volume = {41},
	number = {4},
	pages = {516 -- 526},
	year = {2007}

}

@article{KaHiAr85,
	author = {Kalantari, B. and Hill, A. V. and Arora, S. R.},
	title = {An algorithm for the traveling salesman problem with pickup and delivery customers},
	journal = {European Journal of Operational Research},
	volume = {22},
	pages = {377-386},
	year = {1985}
}

@article{DuDeSo91,
	author = {Dumas, Y. and Desrosiers, J. and Soumis, F.},
	title = {The pickup and delivery problem with time windows},
	journal = {European Journal of Operational Research},
	volume = {54},
	pages = {7-22},
	year = {1991}
}

@article{RoCo09,
	author = {Ropke, S. and Cordeau, J.F.},
	title = {Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows},
	journal = {TRANSPORTATION SCIENCE},
	volume = {43},
	pages = {267-286},
	year = {2009}
}

@article{RoCo07,
	author = {Ropke, S. and Cordeau, J.F. and Laporte, G.},
	title = {Models and branch-and-cut algorithms for pickup and delivery problems with time windows},
	journal = {Networks},
	volume = {49},
	pages = {258-272},
	year = {2007}
}

@article{PaDoHa08,
	author = {Parragh, S. and Doerner, K. and Hartl, R.},
	title = {A survey on pickup and delivery problems: Part II: Transportation between pickup and delivery locations},
	journal = {Journal für Betriebswirtschaft},
	volume = {58},
	year = {2008}
}

@article{SaSo95,
	author = {Savelsbergh, M.W.P. and Sol, M.},
	title = {The general pickup and delivery problem},
	journal = {Transportation Science},
	volume = {29},
	year = {1995},
	pages = {17-29}
}

@incollection{CoLaRo08,
	author = {Cordeau, J.-F. and Laporte, G. and Ropke, S.},
	title = {Recent Models and Algorithms for One-to-One Pickup and Delivery Problems}, 
	booktitle = {Vehicle Routing: Latest Advances and Challenges}, 
	editor = {Golden, B. L. and Raghavan, S. and Wasil, E.A.},
	publisher = {Springer},
	pages={327-357}, 
	year = {2008}
}

@article{SaSo98,
	author = {Savelsbergh, M.W.P. and Sol, M.},
	title = {DRIVE: Dynamic routing of independent vehicles},
	journal = {Oper. Res.},
	pages = {474-490},
	volume = {29},
	year = {1998}
}

@inproceedings{LiSaRi06,
	author = {Liberatore, F. and Salani, M. and Righini, G.},
	title = {A pricing algorithm for the vehicle routing problem with soft time windows},
	booktitle = {Proceedings of the International Workshop on Distribution Logistics, Brescia, 2006},
	editor = {Bertazzi, L. and Speranza, M.G. and van Nunen, J.A.E.E.},
	series = {LNEMS},
	pages = {251-266},
	volume = {619},
	year = {2009}
}

@article{SeCh86,
	author = {Sexton, T.R. and  Choi, Y.M.},
	title = {Pickup and delivery of partial loads with soft time windows},
	journal = {American Journal of Mathematical and Management Sciences},
	volume = {6},
	pages = {369-398},
	year = {1986}
}

@article{Co06,
	author = {Cordeau, J.-F.},
	title = {A Branch-and-Cut Algorithm for the Dial-a-Ride Problem},
	journal = {Operations Research},
	volume = {54}, 
	pages = {573-586},
	year = {2006}
}

@article{QuTaYa09,
	author = {Qureshi, A.G. and  Taniguchi, E. and Yamada, T.},
	title = {An exact solution approach for vehicle routing and scheduling problems with soft time windows},
	journal = {Transportation Research Part E: Logistics and Transportation Review},
	volume = {45}, 
	year = {2009}, 
	pages = {960-977}
}
