Column-generation in integer linear programming
We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of so-called geometrical cuts to be added to the subproblem in ord...
Guardado en:
| Autor principal: | |
|---|---|
| Otros Autores: | , , |
| Formato: | Capítulo de libro |
| Lenguaje: | Inglés |
| Publicado: |
2003
|
| Acceso en línea: | Registro en Scopus DOI Handle Registro en la Biblioteca Digital |
| Aporte de: | Registro referencial: Solicitar el recurso aquí |
| LEADER | 23308caa a22013097a 4500 | ||
|---|---|---|---|
| 001 | PAPER-4756 | ||
| 003 | AR-BaUEN | ||
| 005 | 20230518203420.0 | ||
| 008 | 190411s2003 xx ||||fo|||| 00| 0 eng|d | ||
| 024 | 7 | |2 scopus |a 2-s2.0-26444502957 | |
| 040 | |a Scopus |b spa |c AR-BaUEN |d AR-BaUEN | ||
| 100 | 1 | |a Maculan, N. | |
| 245 | 1 | 0 | |a Column-generation in integer linear programming |
| 260 | |c 2003 | ||
| 270 | 1 | 0 | |m Programa de Engenharia de Sistemas e Computação - COPPE, Universidade Federal do Rio de JaneiroBrazil; email: maculan@cos.ufrj.br |
| 506 | |2 openaire |e Política editorial | ||
| 504 | |a Anbil, R., Forrest, J., Pulleyblank, W., Column generation and the airline crew pairing problem (1998) DOC. Math. J. DMV, pp. 677-686 | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a Borndorfer, R., Grotschel, M., Lobel, A., (2001) Scheduling Duties by Adptive Column Generation, , ZIB-Report 01-02 | ||
| 504 | |a Bourjolly, J., Laporte, G., Mercure, H., A combinatorial column generation algorithm for the maximun stable set problem (1997) Oper. Res. Lett. | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a Chen, Z., Powell, W., A column generation based descomposition algorithm for a parallel machine scheduling problem (1999) EJOR, 116, pp. 220-232 | ||
| 504 | |a Chvátal, V., (1983) Linear Programming, , W.H. Freeman and Company, New York, San Francisco | ||
| 504 | |a Crama, Y., Van De Klundert, J., Approximation algorithms for integer covering problems via greedy column generation (1994) RAIRO: Oper. Res., 28, pp. 283-302 | ||
| 504 | |a Dakin, R., A tree search algorithm for mixed integer programming problems (1965) Comput. J., 8, pp. 250-255 | ||
| 504 | |a Dantzig, G.B., Upper bounds, secondary constraints and block triangulary in linear programming (1995) Econometrica, 23, pp. 174-183 | ||
| 504 | |a Dantzig, G.B., (1963) Linear Programming and Extensions, , Princeton University Press, New Jersey, USA | ||
| 504 | |a Dantzig, G.B., Wolfe, P., Decomposition principle for linear programming (1960) Oper. Res., 8, pp. 101-111 | ||
| 504 | |a 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 | ||
| 504 | |a Delorme, J., (1974) Contributions à la Résolution du Problème de Recouvrement: Méthode de Troncature, , Docteur-ingenieur dissertation. Université Paris VI, Paris, France | ||
| 504 | |a 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 | ||
| 504 | |a Desaulniers, G., Desrosiers, J., Dumas, Y., Solomon, M., (1994) Daily Aircraft Routing and Scheduling, , Cahiers du Gerad G-94-21 | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a Desrochers, J., Soumis, F., A column-generation approach to the urban transit crew scheduling problem (1989) Transportation Sci., 23, pp. 1-13 | ||
| 504 | |a Desrosiers, J., Soumis, F., Desrochers, M., Routing with time-windows by column generation (1984) Networks, 14, pp. 545-565 | ||
| 504 | |a EbenChaime, M., Tovey, C., Amnions, J.C., Circuit partitioning via set partitioning and column generation (1996) Oper. Res., 44, pp. 65-76 | ||
| 504 | |a 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 | ||
| 504 | |a Gilmore, P.C., Gomory, R.E., A linear programming approach to the cutting stock problem (1961) Oper. Res., 9, pp. 849-859 | ||
| 504 | |a Gilmore, P.C., Gomory, R.E., A linear programming approach to the cutting stock problem - Part II (1963) Oper. Res., 11, pp. 863-888 | ||
| 504 | |a 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 | ||
| 504 | |a Jaumard, B., Labit, P., Ribeiro, C., (1999) A Column Generation Aproach to Cell Formation Problems in Cellular Manufacturing, , Cahiers du Gerad G-99-20 | ||
| 504 | |a 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 | ||
| 504 | |a Jaumard, B., Meyer, C., Vovor, T., (1999) Column/Row Generation and Elimination Methods, , Cahiers du Gerad G-99-34 | ||
| 504 | |a Johnson, E., Mehrotal, A., Nemhauser, G.L., Min-cut clustering (1993) Math. Programming, 62, pp. 133-152 | ||
| 504 | |a Kroon, L., Fischetti, M., (2001) Crew Scheduling for Netherlands Railways "Destination Customer" | ||
| 504 | |a Lasdon, L.S., (1970) Optimization Theory for Large Systems, , Macmillan, New York, USA | ||
| 504 | |a Lobel, A., Vehicle scheduling in public transit and Lagrangian pricing (1998) Management Sci., 44, pp. 1637-1649 | ||
| 504 | |a Marcotte, O., The cutting stock problem and integer rounding (1985) Math. Programming, 13, pp. 82-92 | ||
| 504 | |a Maculan, N., Fampa, M., Michelon, P., (1999) Programação Linear e Inteira, , Notes - COPPE/Universidade Federal do Rio de Janeiro | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a Mehrotra, A., Trick, M., A column generation approach for graph coloring (1996) INFORMS J. Comput., 8, pp. 344-353 | ||
| 504 | |a 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 | ||
| 504 | |a Minoux, M., A class of combinatorial problems with polynomially solvable large scale set covering/partioning relaxations (1987) RAIRO: Oper. Res., 21, pp. 105-136 | ||
| 504 | |a Nemhauser, G.L., Park, S., A polyhedral approach to edge coloring (1991) Oper. Res. Lett., 10, pp. 315-322 | ||
| 504 | |a Nemhauser, G.L., Wolsey, L.A., (1988) Integer and Combinatorial Optimization, , John Wiley & Sons Inc | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a Ribeiro, C., Soumis, F., A column generation approach to the multiple-depot vehicle scheduling problem (1994) Oper. Res., 42, pp. 41-52 | ||
| 504 | |a Savelsbergh, M., A branch-and-price algorithm for the generalized assignment problem (1997) Oper. Res., 46, pp. 831-841 | ||
| 504 | |a 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 | ||
| 504 | |a Sutter, A., Vanderbeck, F., Wolsey, L., Optimal placemente of add/drop multiplexers: Heuristic and exact algorithms (1998) Oper. Res., 46, pp. 719-728 | ||
| 504 | |a Taillard, E.D., A heuristic generation method for the heterogeneous fleet VRP (1999) RAIRO: Oper. Res., 33, pp. 1-14 | ||
| 504 | |a Vanderbeck, F., (1994) Decomposition and Column Generation for Integer Programming, , These de doctorat en Sciences Appliquées. Université Catholique de Louvain, Louvain, Belgique | ||
| 504 | |a Vance, P.H., Branch-and-price algorithms for the one-dimensional cutting stock problem (1998) Comput. Optim. Appl., 9, pp. 211-228 | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a Vanderbeck, F., Computational study of a column generation algorithm for bin packing and cut stocking problems (1999) Math. Programming, 86, pp. 565-594 | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a Vanderbeck, F., Wolsey, L., An exact algorithm for IP column generation (1996) Oper. Res. Lett., 19, pp. 151-159 | ||
| 520 | 3 | |a We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of so-called geometrical cuts to be added to the subproblem in order to eliminate previously generated columns. This scheme could be applied to general integer problems without specific structure. We report computational results on a successful application of this approach to a telecommunications network planning problem. © EDP Sciences 2003. |l eng | |
| 536 | |a Detalles de la financiación: Conselho Nacional de Desenvolvimento Científico e Tecnológico, CNPq | ||
| 536 | |a Detalles de la financiación: Coordenação de Aperfeiçoamento de Pessoal de Nível Superior | ||
| 536 | |a Detalles de la financiación: Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro | ||
| 536 | |a Detalles de la financiación: CONICET 644/98, UBACYT EX036 | ||
| 536 | |a Detalles de la financiación: Fundação Universitária José Bonifácio | ||
| 536 | |a Detalles de la financiación: Maculan Nelson 1 Marcos de Mendonça Passini 1 José André de Moura Brito 1 Loiseau Irene 2 1 Programa de Engenharia de Sistemas e Computação – COPPE – Universidade Federal do Rio de Janeiro, Brasil. Partially supported by CNPq, CAPES, FUJB, FAPERJ, PRONEX. 2 Departamento de Computación – Facultad de Ciencias Exactas y Naturales – Universidad de Buenos Aires, Argentina; irene@dc.uba.ar.. Partially supported by grants UBACYT EX036, CONICET 644/98. 29 03 2010 15 11 2003 04 2003 37 2 ro/2003/02 67 83 1 2002 © EDP Sciences, 2003 2003 EDP Sciences We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of so-called geometrical cuts to be added to the subproblem in order to eliminate previously generated columns. This scheme could be applied to general integer problems without specific structure. We report computational results on a successful application of this approach to a telecommunications network planning problem. Column-generation integer programming branch-and-price. article origin xml_rich idline RAIRO Oper. Res. 37 (2003) 67-83 cover_date April-June 2003 first_month 04 last_month 06 first_year 2003 last_year 2003 R. Anbil, J. Forrest and W. Pulleyblank, Column generation and the airline crew pairing problem. DOC. Math. J. DMV (1998) 677-686. C. Barnhart , C. Hanne and P.H. Vance , Using branch-and-price and cut to solve origin destination integer multicommodity flow problems. Oper. Res. 48 ( 2000 ) 318 - 326 . C. Barnhart , E.L. Johnson , G.L. Nemhauser , M.W.P. Savelsbergh and P.H. Vance , Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46 ( 1998 ) 316 - 329 . R. Borndorfer, M. Grotschel and A. Lobel, Scheduling duties by adptive column generation . ZIB-Report 01-02 (2001). J. Bourjolly, G. Laporte and H. Mercure, A combinatorial column generation algorithm for the maximun stable set problem. Oper. Res. Lett. (1997). J.A.M. Brito, Um modelo de otimizaç ao para dimensionamento de uma rede de telecomunicaç oes , Tese de mestrado, COPPE. Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brasil (1999). J. Bramel and D. Simchi-Levi , On the effectiveness of set covering formulations for the vehicle routing problem with time windows. Oper. Res. 45 ( 1997 ) 295 - 301 . S. Butt and D.M. Ryan , An optimal solution procedure for the multiple tour maximum collec tion problem using column generation. Comp. Oper. Res. 26 ( 1999 ) 427 - 441 . Z. Chen and W. Powell , A column generation based descomposition algorithm for a parallel machine scheduling problem. EJOR 116 ( 1999 ) 220 - 232 . V. Chvátal, Linear programming . W.H. Freeman and Company, New York, San Francisco (1983). Y. Crama and J. Van de Klundert , Approximation algorithms for integer covering problems via greedy column generation. RAIRO: Oper. Res. 28 ( 1994 ) 283 - 302 . R. Dakin , A tree search algorithm for mixed integer programming problems. Comput. J. 8 ( 1965 ) 250 - 255 . G.B. Dantzig , Upper bounds, secondary constraints and block triangulary in linear programming. Econometrica 23 ( 1995 ) 174 - 183 . G.B. Dantzig, Linear programming and extensions . Princeton University Press, New Jersey, USA (1963). G.B. Dantzig and P. Wolfe , Decomposition principle for linear programming. Oper. Res. 8 ( 1960 ) 101 - 111 . J.M.V. de Carvalho , Exact solution of cutting stock problems using column generation and branch-and-bound. Int. Trans. Oper. Res. 5 ( 1998 ) 35 - 43 . J. Delorme, Contributions à la résolution du problème de recouvrement : méthode de troncature , Docteur-ingenieur dissertation. Université Paris VI, Paris, France (1974). G. Desaulniers, J. Desrosiers and M. Solomon, Accelerating strategies in Column Generation methods for vehicle routing and crew scheduling . Cahiers du Gerad G-99-36 (1999). G. Desaulniers, J. Desrosiers, Y. Dumas and M. Solomon, Daily Aircraft routing and Scheduling . Cahiers du Gerad G-94-21 (1994). G. Desaulniers, J. Desrosiers and M. Solomon, Accelerating strategies in Column Generation Methods for Vehicle Routing and crew scheduling problems . Cahiers du Gerad G-99-36 (1994). M. Desrochers , J. Desrosiers and M. Solomon , A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40 ( 1992 ) 342 - 353 . J. Desrosiers, Y. Dumas, M.N. Solomon and F. Soumis, Time constrained routing and scheduling , edited by M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser, Network Routing . INFORMS - North Holland, Handbooks Oper. Res. Management Sci. 8 (1995) 35-139. J. Desrochers and F. Soumis , A column-generation approach to the urban transit crew scheduling problem. Transportation Sci. 23 ( 1989 ) 1 - 13 . J. Desrosiers , F. Soumis and M. Desrochers , Routing with time-windows by column generation. Networks 14 ( 1984 ) 545 - 565 . M. EbenChaime , C. Tovey and J.C. Ammons , Circuit partitioning via set partitioning and column generation. Oper. Res. 44 ( 1996 ) 65 - 76 . M. Gamache , F. Soumis , G. Marquis and J. Desrosiers , A column generation approach for large-scale aircrew rostering problems. Oper. Res. 48 ( 1992 ) 247 - 263 . P.C. Gilmore and R.E. Gomory , A linear programming approach to the cutting stock problem. Oper. Res. 9 ( 1961 ) 849 - 859 . P.C. Gilmore and R.E. Gomory , A linear programming approach to the cutting stock problem - Part II. Oper. Res. 11 ( 1963 ) 863 - 888 . P. Hansen , B. Jaumard and M.V. Poggi de Arag ao, Un algorithme primal de programmation linéaire généralisée pour les programmes mixtes. C. R. Acad. Sci. Paris Sér. I Math. 313 ( 1991 ) 557 - 560 . B. Jaumard, P. Labit and C. Ribeiro, A Column Generation Aproach to Cell Formation Problems in Cellular Manufacturing . Cahiers du Gerad G-99-20 (1999). B. Jaumard, C. Meyer and T. Vovor, 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 (1999). B. Jaumard, C. Meyer and T. Vovor, Column/Row Generation and Elimination Methods . Cahiers du Gerad G-99-34 (1999). E. Johnson , A. Mehrotal and G.L. Nemhauser , Min-cut clustering. Math. Programming 62 ( 1993 ) 133 - 152 . L. Kroon and M. Fischetti, Crew Scheduling for Netherlands Railways ``Destination Customer" (2001). L.S. Lasdon, Optimization Theory for Large Systems . Macmillan, New York, USA (1970). A. Lobel , Vehicle scheduling in public transit and Lagrangian pricing. Management Sci. 44 ( 1998 ) 1637 - 1649 . O. Marcotte , The cutting stock problem and integer rounding. Math. Programming 13 ( 1985 ) 82 - 92 . N. Maculan, M. Fampa and P. Michelon, Programaç ao linear e inteira . Notes - COPPE/Universidade Federal do Rio de Janeiro (1999). N. Maculan , P. Michelon and G. Plateau , Column generation in linear programming with bounding variable constraints and its applications in integer programming. Pesquisa Operacional 12 ( 1992 ) 45 - 57 . N. Maculan, M.M. Passini, J.A.M. Brito and A. Lisser, Column generation method for network design, Transportation and Network Analysis Current Trends , edited by M. Gendreau and P. Marcotte. Kluwer Academic Publishers (2002) 165-179. A. Mehrotra and M. Trick , A column generation approach for graph coloring. INFORMS J. Comput. 8 ( 1996 ) 344 - 353 . M. Minoux , Optimal traffic assignment in a SS/TDMA frame: A new approach by set covering and column generation. RAIRO: Oper. Res. 20 ( 1986 ) 273 - 286 . M. Minoux , A class of combinatorial problems with polynomially solvable large scale set covering/partioning relaxations. RAIRO: Oper. Res. 21 ( 1987 ) 105 - 136 . G.L. Nemhauser and S. Park , A polyhedral approach to edge coloring. Oper. Res. Lett. 10 ( 1991 ) 315 - 322 . G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization . John Wiley & Sons Inc. (1988). M.M. Passini, Um modelo de otimizaç ao combinatória para o dimensionamento de uma rede urbana de telecomunicaç oes , M.Sc. Thesis. COPPE, Universidade Federal do Rio de Janeiro (1996). D.M. Ryan and B.A. Foster, An integer programming approach to scheduling, in Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling . North Holland (1981). C. Ribeiro , M. Minoux and M.C. Penna , An optimal column-generation-with-ranking algorithm for very large scale partitioning problems in traffic assignment. Eur. J. Oper. Res. 41 ( 1989 ) 232 - 239 . C. Ribeiro and F. Soumis , A column generation approach to the multiple-depot vehicle scheduling problem. Oper. Res. 42 ( 1994 ) 41 - 52 . M. Savelsbergh , A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 46 ( 1997 ) 831 - 841 . L.G. Simonetti, Geraç ao de colunas para o problema de empacotamento de árvores de Steiner , M.Sc. dissertation. Universidade Federal do Rio de Janeiro (2003). A. Sutter , F. Vanderbeck and L. Wolsey , Optimal placemente of add/drop multiplexers: Heuristic and exact algorithms. Oper. Res. 46 ( 1998 ) 719 - 728 . E.D. Taillard , A heuristic generation method for the heterogeneous fleet VRP. RAIRO: Oper. Res. 33 ( 1999 ) 1 - 14 . F. Vanderbeck, Decomposition and Column Generation for Integer Programming , Thèse de doctorat en Sciences Appliquées. Université Catholique de Louvain, Louvain, Belgique (1994). P.H. Vance , Branch-and-price algorithms for the one-dimensional cutting stock problem. Comput. Optim. Appl. 9 ( 1998 ) 211 - 228 . P.H. Vance , C. Barnhart , E.L. Johnson and G.L. Nemhauser , Solving binary cutting stock problems by column generation and branch-and-bound. Comput. Optim. Appl. 3 ( 1994 ) 111 - 130 . P.H. Vance , C. Barnhart , E.L. Johnson and G.L. Nemhauser , Airline crew scheduling: A new formulation and decomposition algorithm. Oper. Res. 45 ( 1997 ) | ||
| 593 | |a Programa de Engenharia de Sistemas e Computação - COPPE, Universidade Federal do Rio de Janeiro, Brazil | ||
| 593 | |a Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Argentina | ||
| 690 | 1 | 0 | |a BRANCH-AND-PRICE |
| 690 | 1 | 0 | |a COLUMN-GENERATION |
| 690 | 1 | 0 | |a INTEGER PROGRAMMING |
| 690 | 1 | 0 | |a BINARY SEQUENCES |
| 690 | 1 | 0 | |a COMPUTATIONAL GEOMETRY |
| 690 | 1 | 0 | |a COMPUTATIONAL METHODS |
| 690 | 1 | 0 | |a INTEGER PROGRAMMING |
| 690 | 1 | 0 | |a PROBLEM SOLVING |
| 690 | 1 | 0 | |a TELECOMMUNICATION NETWORKS |
| 690 | 1 | 0 | |a VECTORS |
| 690 | 1 | 0 | |a BINARY COLUMN VECTORS |
| 690 | 1 | 0 | |a COLUMN GENERATION |
| 690 | 1 | 0 | |a INTEGER LINEAR PROGRAMMING |
| 690 | 1 | 0 | |a INTEGER PROBLEMS |
| 690 | 1 | 0 | |a LINEAR PROGRAMMING |
| 700 | 1 | |a De Mendonça Passini, M. | |
| 700 | 1 | |a De Moura Brito, J.A. | |
| 700 | 1 | |a Loiseau, I. | |
| 773 | 0 | |d 2003 |g v. 37 |h pp. 67-83 |k n. 2 |p RAIRO Oper. Res. |x 03990559 |t RAIRO - Operations Research | |
| 856 | 4 | 1 | |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-26444502957&doi=10.1051%2fro%3a2003014&partnerID=40&md5=a4df5c394268efb0adc01ccc8fdf0701 |y Registro en Scopus |
| 856 | 4 | 0 | |u https://doi.org/10.1051/ro:2003014 |y DOI |
| 856 | 4 | 0 | |u https://hdl.handle.net/20.500.12110/paper_03990559_v37_n2_p67_Maculan |y Handle |
| 856 | 4 | 0 | |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03990559_v37_n2_p67_Maculan |y Registro en la Biblioteca Digital |
| 961 | |a paper_03990559_v37_n2_p67_Maculan |b paper |c PE | ||
| 962 | |a info:eu-repo/semantics/article |a info:ar-repo/semantics/artículo |b info:eu-repo/semantics/publishedVersion | ||
| 999 | |c 65709 | ||