Referencias:

• Den Akker, J.V., Hoogeveen, J., Van De Velde, S., Parallel machine scheduling by column generation (1999) Operations Research, 47 (6), pp. 862-872. , [AKK 99]
• Barnhart, C., Johnson, E.L., Nemhauser, G., Savelsbergh, M.W., Vance, P.H., Branch-and-price: Column generation for solving huge integer programs (1998) Operations Research, 46, pp. 316-329. , [BAR 98]
• Barnhart, C., Hanne, C., Vance, P.H., Using branch-and-price and cut to solve origin destination integer multicommodity flow problems (2000) Operations Research, 48, pp. 318-326. , [BAR 00]
• Bourjolly, J., Laporte, G., Mercure, H., A combinatorial column generation algorithm for the maximum stable set problem (1997) Operations Research Letters, 20, pp. 21-29. , [BOU 97]
• Bramel, J., Simchi-Levi, D., On the effectiveness of set covering formulations for the vehicle routing problem with time windows (1997) Operations Research, 45, pp. 295-301. , [BRA 97]
• Bramel, J., Simchi-Levi, D., (2002) "Set-covering-based algorithms for the capacitated VRP", pp. 85-108. , [BRA 02], SIAM Monographs on Discrete Mathematics and Applications, SIAM
• De Carvalho, J., Exact solution of cutting stock problems using column generation and branch-and-bound (1998) International Transactions in Operational Research, 5 (1), pp. 35-43. , [CAR 98]
• Ceselli, A., (2002) Algoritmi Branch & Bound e Branch & Price per il problema delle p-mediane con capacità, , [CES 02], Università degli Studi di Milano, Milan, Italy
• Christofides, N., Mingozzi, A., Toth, P., State-space relaxation procedures for the computation of bounds to routing problems (1981) Networks, 11, pp. 145-164. , [CHR 81]
• Chvátal, V., (1983) Linear Programming, W, , [CHV 83], H. Freeman & Co., New York/San Francisco
• Dakin, R., A tree search algorithm for mixed integer programming problems (1965) Computer Journal, 8, pp. 250-255. , [DAK 65]
• Dantzig, G., Wolfe, P., Decomposition principle for linear programming (1960) Operations Research, 8, pp. 101-111. , [DAN 60]
• Dantzig, G., (1963) Linear Programming and Extensions, , [DAN 63], Princeton University Press, Princeton, NJ
• Dantzig, G., Upper bounds, secondary constraints and block triangularity in linear programming (1995) Econometrica, 23, pp. 174-183. , [DAN 95]
• Dell'Amico, M., Righini, G., Salani, M., (2003) A branch-and-price algorithm for the vehicle routing problem with simultaneous pick-up and delivery, , [DEL 03], Report, Università degli Studi di Milano, Milan, Italy
• Desrosiers, J., Soumis, F., Desrochers, M., Routing with time-windows by column generation (1984) Networks, 14, pp. 545-565. , [DES 84]
• Desrochers, J., Soumis, F., A column-generation approach to the urban transit crew scheduling problem (1989) Transportation Science, 23, pp. 1-13. , [DES 89]
• Desrochers, M., Desrosiers, J., Solomon, M., A new optimization algorithm for the vehicle routing problem with time windows (1992) Operations Research, 40 (2), pp. 342-353. , [DES 92]
• Desrosiers, J., Dumas, Y., Solomon, M., Soumis, F., (1995) Time Constrained Routing and Scheduling, , [DES 95], INFORMS
• Desaulniers, G., Desrosiers, J., Ioachim, I., Solomon, M., Soumis, F., Villeneuve, D., (1998) A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems, pp. 57-93. , [DES 98], Kluwer, Boston, MA
• Dror, M., Note on the complexity of the shortest path models for column generation in VRPTW (1994) Operations Research, 42 (5), pp. 977-978. , [DRO 94]
• Feillt, D., Dejax, P., Gendreau, M., Gueguen, C., (2003) An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems, , [FEI 03], Report , CRT
• Gamache, M., Soumis, F., Marquis, G., Desrosiers, J., A column generation approach for large-scale aircrew rostering problems (1992) Operations Research, 48 (2), pp. 247-263. , [GAM 92]
• Gélinas, S., Desrochers, M., Desrosiers, J., Solomon, M., (1992) A new branching strategy for time constrained routing problems with application to backhauling, , [GEL 92], Report, GERAD
• Gilmore, P., Gomory, R., A linear programming approach to the cutting stock problem (1961) Operations Research, 9, pp. 849-859. , [GIL 61]
• Gilmore, P., Gomory, R., A linear programming approach to the cutting stock problem-part II (1963) Operations Research, 11, pp. 863-888. , [GIL 63]
• Hansen, P., Jaumard, B., De Aragão, M.P., (1991) Un algorithme primal de programmation linéaire généralisée pour les programmes mixtes, Report, C, , [HAN 91], R. Acad. Sci. Paris
• Johnson, E., Mehrotal, A., Nemhauser, G., Min-cut clustering (1993) Mathematical Programming, 62, pp. 133-152. , [JOH 93]
• Labbé, M., Peeters, D., Thisse, J., (1995) Location on Networks, 8, pp. 551-624. , [LAB 95], Elsevier Science
• Lasdon, L.S., (1970) Optimization Theory for Large Systems, , [LAS 70], Macmillan, New York
• Lobel, A., Vehicle scheduling in public transit and lagrangean pricing (1998) Management Science, 12 (44), pp. 1637-1649. , [LOB 98]
• Maculan, N., Macambira, E., De Souza, C., (2001) Geometric cuts for 0-1 integer programming, , [MAC 01], Report, Engenharia de Sistemas, COPPE, Universidade Federal do Rio de Janeiro
• Maculan, N., Passini, M., Brito, J., Lisser, A., (2002) Column Generation Method for Network Design, pp. 165-179. , [MAC 02], Kluwer Academic Press
• Maculan, N., Passini, M., Brito, J., Loiseau, I., Column-generation in integer linear programming (2003) RAIRO-Recherche Opérationnelle, 37 (2), pp. 67-83. , [MAC 03]
• Marcotte, O., The cutting stock problem and integer rounding (1985) Mathematical Programming, 13, pp. 82-92. , [MAR 85]
• Martello, S., Toth, P., (1990) Knapsack Problems-Algorithms and Computer Implementations, , [MAR 90], John Wiley & Sons, New York
• Mehrotra, A., Trick, M., A column generation approach for graph coloring (1996) INFORMS Journal on Computing, 8 (4), pp. 344-353. , [MEH 96]
• Minoux, M., Optimal traffic assignment in a SS/TDMAframe: A new approach by set covering and column generation (1986) RAIRO-Recherche Operationnelle, 20 (4), pp. 273-286. , [MIN 86]
• Mirchandani, P., The p-median problem and generalizations (1990) Discrete Location Theory, , [MIR 90], Wiley Interscience Series, John Wiley & Sons, New York
• Nemhauser, G.L., Wolsey, L.A., (1988) Integer and Combinatorial Optimization, , [NEM 88], John Wiley & Sons, New York
• Ribeiro, C., Minoux, M., Penna, M., An optimal column-generation-withranking algorithm for very large scale partitioning problems in traffic assignment (1989) European Journal of Operational Research, 41, pp. 232-239. , [RIB 89]
• Ribeiro, C., Soumis, F., A column generation approach to the multiple-depot vehicle scheduling problem (1994) Operations Research, 42, pp. 41-52. , [RIB 94]
• Ryan, D., Foster, B., An integer programming approach to scheduling (1981) Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, , [RYA 81], North Holland
• Savelsbergh, M., A branch-and-price algorithm for the generalized assignment problem (1997) Operations Research, 46, pp. 831-841. , [SAV 97]
• Simonetti, L.G., (2003) Geração de colunas para o problema de empacotamento de árvores de Steiner, , [SIM 03], Universidade Federal do Río de Janeiro
• Taillard, E., A heuristic generation method for the heterogeneous fleet VRP (1999) RAIRO Recherche Operationnelle, 33 (1), pp. 1-14. , [TAI 99]
• Toth, P., Vigo, D., The vehicle routing problem (2002) SIAM Monographs on Discrete Mathematics and Applications, , [TOT 02], SIAM
• Vance, P.H., Barnhart, C., Johnson, E.L., Nemhauser, G.L., Solving binary cutting stock problems by column generation and branch-and-bound (1994) Computational Optimization and Applications, 3, pp. 111-130. , [VAN 94a]
• Vanderbeck, F., (1994) Decomposition and Column Generation for Integer Programming, , [VAN 94b], Thèse de doctorat, PhD thesis, Catholic University of Louvain, Louvain, Belgium
• Vanderbeck, F., Wolsey, L., An exact algorithm for IP column generation (1996) Operations Research Letters, 19, pp. 151-159. , [VAN 96]
• Vance, P.H., Barnhart, C., Johnson, E.L., Nemhauser, G.L., Airline crew scheduling: a new formulation and decomposition algorithm (1997) Operations Research, 45 (2), pp. 188-200. , [VAN 97]
• Vance, P.H., Branch-and-price algorithms for the one-dimensional cutting stock problem (1998) Computational Optimization and Applications, 9, pp. 211-228. , [VAN 98]
• Vanderbeck, F., Computational study of a column generation algorithm for bin packing and cut stocking problems (1999) Mathematical Programming, 86, pp. 565-594. , [VAN 99]
• Vanderbeck, F., On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm (2000) Operations Research, 48 (1), pp. 111-128. , [VAN 00]
• Wolsey, L., (1998) Integer Programming, , [WOL 98], John Wiley & Sons, New York

Citas:

---------- APA ----------

---------- CHICAGO ----------

---------- MLA ----------

---------- VANCOUVER ----------