Registro:

Referencias:

• Anbil, R., Forrest, J., Pulleyblank, W., Column generation and the airline crew pairing problem (1998) DOC. Math. J. DMV, pp. 677-686
• Barnhart, C., Hanne, C., Vance, P.H., Using branch-and-price and cut to solve origin destination integer multicommodity flow problems (2000) Oper. Res., 48, pp. 318-326
• Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H., Branch-and-price: Column generation for solving huge integer programs (1998) Oper. Res., 46, pp. 316-329
• Borndorfer, R., Grotschel, M., Lobel, A., (2001) Scheduling Duties by Adptive Column Generation, , ZIB-Report 01-02
• Bourjolly, J., Laporte, G., Mercure, H., A combinatorial column generation algorithm for the maximun stable set problem (1997) Oper. Res. Lett.
• Brito, J.A.M., (1999) Um Modelo de Otimização para Dimensionamento de Uma Rede de Telecomunicações, , Tese de mestrado, COPPE. Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brasil
• Bramel, J., Simchi-Levi, D., On the effectiveness of set covering formulations for the vehicle routing problem with time windows (1997) Oper. Res., 45, pp. 295-301
• Butt, S., Ryan, D.M., An optimal solution procedure for the multiple tour maximum collec tion problem using column generation (1999) Comp. Oper. Res., 26, pp. 427-441
• Chen, Z., Powell, W., A column generation based descomposition algorithm for a parallel machine scheduling problem (1999) EJOR, 116, pp. 220-232
• Chvátal, V., (1983) Linear Programming, , W.H. Freeman and Company, New York, San Francisco
• Crama, Y., Van De Klundert, J., Approximation algorithms for integer covering problems via greedy column generation (1994) RAIRO: Oper. Res., 28, pp. 283-302
• Dakin, R., A tree search algorithm for mixed integer programming problems (1965) Comput. J., 8, pp. 250-255
• Dantzig, G.B., Upper bounds, secondary constraints and block triangulary in linear programming (1995) Econometrica, 23, pp. 174-183
• Dantzig, G.B., (1963) Linear Programming and Extensions, , Princeton University Press, New Jersey, USA
• Dantzig, G.B., Wolfe, P., Decomposition principle for linear programming (1960) Oper. Res., 8, pp. 101-111
• De Carvalho, J.M.V., Exact solution of cutting stock problems using column generation and branch-and-bound (1998) Int. Trans. Oper. Res., 5, pp. 35-43
• Delorme, J., (1974) Contributions à la Résolution du Problème de Recouvrement: Méthode de Troncature, , Docteur-ingenieur dissertation. Université Paris VI, Paris, France
• Desaulniers, G., Desrosiers, J., Solomon, M., (1999) Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling, , Cahiers du Gerad G-99-36
• Desaulniers, G., Desrosiers, J., Dumas, Y., Solomon, M., (1994) Daily Aircraft Routing and Scheduling, , Cahiers du Gerad G-94-21
• Desaulniers, G., Desrosiers, J., Solomon, M., (1994) Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems, , Cahiers du Gerad G-99-36
• Desrochers, M., Desrosiers, J., Solomon, M., A new optimization algorithm for the vehicle routing problem with time windows (1992) Oper. Res., 40, pp. 342-353
• Desrosiers, J., Dumas, Y., Solomon, M.N., Soumis, F., Time constrained routing and scheduling (1995) Handbooks Oper. Res. Management Sci., 8, pp. 35-139. , edited by M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser, Network Routing. INFORMS - North Holland
• Desrochers, J., Soumis, F., A column-generation approach to the urban transit crew scheduling problem (1989) Transportation Sci., 23, pp. 1-13
• Desrosiers, J., Soumis, F., Desrochers, M., Routing with time-windows by column generation (1984) Networks, 14, pp. 545-565
• EbenChaime, M., Tovey, C., Amnions, J.C., Circuit partitioning via set partitioning and column generation (1996) Oper. Res., 44, pp. 65-76
• Gamache, M., Soumis, F., Marquis, G., Desrosiers, J., A column generation approach for large-scale aircrew rostering problems (1992) Oper. Res., 48, pp. 247-263
• Gilmore, P.C., Gomory, R.E., A linear programming approach to the cutting stock problem (1961) Oper. Res., 9, pp. 849-859
• Gilmore, P.C., Gomory, R.E., A linear programming approach to the cutting stock problem - Part II (1963) Oper. Res., 11, pp. 863-888
• Hansen, P., Jaumard, B., Poggi De Aragão, M.V., Un algorithme primal de programmation linéaire généralisée pour les programmes mixtes (1991) C. R. Acad. Sci. Paris Sér. I Math., 313, pp. 557-560
• Jaumard, B., Labit, P., Ribeiro, C., (1999) A Column Generation Aproach to Cell Formation Problems in Cellular Manufacturing, , Cahiers du Gerad G-99-20
• Jaumard, B., Meyer, C., Vovor, T., (1999) How to Combine a Column and Row Generation Method with a Column or Row Elimination Procedures - Application to a Channel Assiggnment Problem, , Cahiers du Gerad G-99-18
• Jaumard, B., Meyer, C., Vovor, T., (1999) Column/Row Generation and Elimination Methods, , Cahiers du Gerad G-99-34
• Johnson, E., Mehrotal, A., Nemhauser, G.L., Min-cut clustering (1993) Math. Programming, 62, pp. 133-152
• Kroon, L., Fischetti, M., (2001) Crew Scheduling for Netherlands Railways "Destination Customer"
• Lasdon, L.S., (1970) Optimization Theory for Large Systems, , Macmillan, New York, USA
• Lobel, A., Vehicle scheduling in public transit and Lagrangian pricing (1998) Management Sci., 44, pp. 1637-1649
• Marcotte, O., The cutting stock problem and integer rounding (1985) Math. Programming, 13, pp. 82-92
• Maculan, N., Fampa, M., Michelon, P., (1999) Programação Linear e Inteira, , Notes - COPPE/Universidade Federal do Rio de Janeiro
• Maculan, N., Michelon, P., Plateau, G., Column generation in linear programming with bounding variable constraints and its applications in integer programming (1992) Pesquisa Operacional, 12, pp. 45-57
• Maculan, N., Passini, M.M., Brito, J.A.M., Lisser, A., Column generation method for network design (2002) Transportation and Network Analysis Current Trends, pp. 165-179. , edited by M. Gendreau and P. Marcotte. Kluwer Academic Publishers
• Mehrotra, A., Trick, M., A column generation approach for graph coloring (1996) INFORMS J. Comput., 8, pp. 344-353
• Minoux, M., Optimal traffic assignment in a SS/TDMA frame: A new approach by set covering and column generation (1986) RAIRO: Oper. Res., 20, pp. 273-286
• Minoux, M., A class of combinatorial problems with polynomially solvable large scale set covering/partioning relaxations (1987) RAIRO: Oper. Res., 21, pp. 105-136
• Nemhauser, G.L., Park, S., A polyhedral approach to edge coloring (1991) Oper. Res. Lett., 10, pp. 315-322
• Nemhauser, G.L., Wolsey, L.A., (1988) Integer and Combinatorial Optimization, , John Wiley & Sons Inc
• Passini, M.M., (1996) Um Modelo de Otimização Combinatória para O Dimensionamento de Uma Rede Urbana de Telecomunicações, , M.Sc. Thesis. COPPE, Universidade Federal do Rio de Janeiro
• Ryan, D.M., Foster, B.A., An integer programming approach to scheduling (1981) Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, , North Holland
• Ribeiro, C., Minoux, M., Penna, M.C., An optimal column-generation-with-ranking algorithm for very large scale partitioning problems in traffic assignment (1989) Eur. J. Oper. Res., 41, pp. 232-239
• Ribeiro, C., Soumis, F., A column generation approach to the multiple-depot vehicle scheduling problem (1994) Oper. Res., 42, pp. 41-52
• Savelsbergh, M., A branch-and-price algorithm for the generalized assignment problem (1997) Oper. Res., 46, pp. 831-841
• Simonetti, L.G., (2003) Geração de Colunas para o Problema de Empacotamento de Árvores de Steiner, , M.Sc. dissertation. Universidade Federal do Rio de Janeiro
• Sutter, A., Vanderbeck, F., Wolsey, L., Optimal placemente of add/drop multiplexers: Heuristic and exact algorithms (1998) Oper. Res., 46, pp. 719-728
• Taillard, E.D., A heuristic generation method for the heterogeneous fleet VRP (1999) RAIRO: Oper. Res., 33, pp. 1-14
• Vanderbeck, F., (1994) Decomposition and Column Generation for Integer Programming, , These de doctorat en Sciences Appliquées. Université Catholique de Louvain, Louvain, Belgique
• Vance, P.H., Branch-and-price algorithms for the one-dimensional cutting stock problem (1998) Comput. Optim. Appl., 9, pp. 211-228
• Vance, P.H., Barnhart, C., Johnson, E.L., Nemhauser, G.L., Solving binary cutting stock problems by column generation and branch-and-bound (1994) Comput. Optim. Appl., 3, pp. 111-130
• Vance, P.H., Barnhart, C., Johnson, E.L., Nemhauser, G.L., Airline crew scheduling: A new formulation and decomposition algorithm (1997) Oper. Res., 45, pp. 188-200
• Vanderbeck, F., Computational study of a column generation algorithm for bin packing and cut stocking problems (1999) Math. Programming, 86, pp. 565-594
• Vanderbeck, F., On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm (2000) Oper. Res., 48, pp. 111-128
• Van Den Akker, J.M., Hoogeveen, J.A., Van De Velde, S.L., Parallel machine scheduling by column generation (1999) Oper. Res., 47, pp. 862-872
• Vanderbeck, F., Wolsey, L., An exact algorithm for IP column generation (1996) Oper. Res. Lett., 19, pp. 151-159

Citas:

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

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

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

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