Artículos de revistas sobre el tema "Algorithmes Branch-And-Cut"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores artículos de revistas para su investigación sobre el tema "Algorithmes Branch-And-Cut".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Fragoso, Felipe C., Gilberto F. de Sousa Filho y Fábio Protti. "Declawing a graph: polyhedra and Branch-and-Cut algorithms". Journal of Combinatorial Optimization 42, n.º 1 (19 de abril de 2021): 85–124. http://dx.doi.org/10.1007/s10878-021-00736-y.
Texto completoCosta, Luciano, Claudio Contardo y Guy Desaulniers. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing". Transportation Science 53, n.º 4 (julio de 2019): 946–85. http://dx.doi.org/10.1287/trsc.2018.0878.
Texto completoPereira, Dilson Lucas, Michel Gendreau y Alexandre Salles da Cunha. "Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem". Networks 65, n.º 4 (2 de febrero de 2015): 367–79. http://dx.doi.org/10.1002/net.21580.
Texto completoFouilhoux, Pierre, A. Ridha Mahjoub, Alain Quilliot y Hélène Toussaint. "Branch-and-Cut-and-Price algorithms for the preemptive RCPSP". RAIRO - Operations Research 52, n.º 2 (abril de 2018): 513–28. http://dx.doi.org/10.1051/ro/2018031.
Texto completoCalvete, Herminia I., Concepción Domínguez, Carmen Galé, Martine Labbé y Alfredo Marín. "The rank pricing problem: Models and branch-and-cut algorithms". Computers & Operations Research 105 (mayo de 2019): 12–31. http://dx.doi.org/10.1016/j.cor.2018.12.011.
Texto completoLi, Xiangyong y Y. P. Aneja. "Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms". European Journal of Operational Research 257, n.º 1 (febrero de 2017): 25–40. http://dx.doi.org/10.1016/j.ejor.2016.07.032.
Texto completoDuchenne, Éric, Gilbert Laporte y Frédéric Semet. "Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem". European Journal of Operational Research 162, n.º 3 (mayo de 2005): 700–712. http://dx.doi.org/10.1016/j.ejor.2003.09.024.
Texto completoArchetti, Claudia, Nicola Bianchessi y M. Grazia Speranza. "Branch-and-cut algorithms for the split delivery vehicle routing problem". European Journal of Operational Research 238, n.º 3 (noviembre de 2014): 685–98. http://dx.doi.org/10.1016/j.ejor.2014.04.026.
Texto completoDesaulniers, Guy, Diego Pecin y Claudio Contardo. "Selective pricing in branch-price-and-cut algorithms for vehicle routing". EURO Journal on Transportation and Logistics 8, n.º 2 (junio de 2019): 147–68. http://dx.doi.org/10.1007/s13676-017-0112-9.
Texto completoDi Summa, Marco, Andrea Grosso y Marco Locatelli. "Branch and cut algorithms for detecting critical nodes in undirected graphs". Computational Optimization and Applications 53, n.º 3 (9 de febrero de 2012): 649–80. http://dx.doi.org/10.1007/s10589-012-9458-y.
Texto completoBektaş, Tolga, Güneş Erdoğan y Stefan Røpke. "Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem". Transportation Science 45, n.º 3 (agosto de 2011): 299–316. http://dx.doi.org/10.1287/trsc.1100.0352.
Texto completoHintsch, Timo, Stefan Irnich y Lone Kiilerich. "Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem". Transportation Science 55, n.º 3 (mayo de 2021): 687–705. http://dx.doi.org/10.1287/trsc.2020.1036.
Texto completoMunapo, Elias, Joshua Chukwuere y Trust Tawanda. "Solving Linear Integer Models with Variable Bounding". Forecasting 5, n.º 2 (5 de mayo de 2023): 443–52. http://dx.doi.org/10.3390/forecast5020024.
Texto completoAdulyasak, Yossiri, Jean-François Cordeau y Raf Jans. "Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems". INFORMS Journal on Computing 26, n.º 1 (febrero de 2014): 103–20. http://dx.doi.org/10.1287/ijoc.2013.0550.
Texto completoQiu, Yuzhuo, Liang Wang, Xuanjing Fang, Panos M. Pardalos y Boris Goldengorin. "Formulations and branch-and-cut algorithms for production routing problems with time windows". Transportmetrica A: Transport Science 14, n.º 8 (26 de enero de 2018): 669–90. http://dx.doi.org/10.1080/23249935.2018.1427157.
Texto completoGadegaard, Sune Lauth, Lars Relund Nielsen y Matthias Ehrgott. "Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets". INFORMS Journal on Computing 31, n.º 4 (octubre de 2019): 790–804. http://dx.doi.org/10.1287/ijoc.2018.0846.
Texto completoAndreas, April K., J. Cole Smith y Simge Küçükyavuz. "Branch-and-price-and-cut algorithms for solving the reliable h-paths problem". Journal of Global Optimization 42, n.º 4 (30 de octubre de 2007): 443–66. http://dx.doi.org/10.1007/s10898-007-9254-x.
Texto completoDrexl, Michael. "Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments". Networks 63, n.º 1 (20 de septiembre de 2013): 119–33. http://dx.doi.org/10.1002/net.21526.
Texto completoSaharidis, Georgios K. D. "Review of Solution Approaches for the Symmetric Traveling Salesman Problem". International Journal of Information Systems and Supply Chain Management 7, n.º 1 (enero de 2014): 73–87. http://dx.doi.org/10.4018/ijisscm.2014010105.
Texto completoChristof, T. y G. Reinelt. "Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut". Algorithmica 30, n.º 4 (1 de octubre de 2001): 597–629. http://dx.doi.org/10.1007/s00453-001-0029-3.
Texto completoRebennack, Steffen, Gerhard Reinelt y Panos M. Pardalos. "A tutorial on branch and cut algorithms for the maximum stable set problem". International Transactions in Operational Research 19, n.º 1-2 (enero de 2012): 161–99. http://dx.doi.org/10.1111/j.1475-3995.2011.00805.x.
Texto completoRopke, Stefan, Jean-François Cordeau y Gilbert Laporte. "Models and branch-and-cut algorithms for pickup and delivery problems with time windows". Networks 49, n.º 4 (2007): 258–72. http://dx.doi.org/10.1002/net.20177.
Texto completoGuimarães, Dilson Almeida y Alexandre Salles da Cunha. "The minimum area spanning tree problem: Formulations, Benders decomposition and branch-and-cut algorithms". Computational Geometry 97 (agosto de 2021): 101771. http://dx.doi.org/10.1016/j.comgeo.2021.101771.
Texto completoBicalho, Luis Henrique, Alexandre Salles da Cunha y Abilio Lucena. "Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem". Computational Optimization and Applications 63, n.º 3 (14 de septiembre de 2015): 755–92. http://dx.doi.org/10.1007/s10589-015-9788-7.
Texto completoWu, Hao, Hao Wen y Yushan Zhu. "Branch-and-Cut Algorithmic Framework for 0−1 Mixed-Integer Convex Nonlinear Programs". Industrial & Engineering Chemistry Research 48, n.º 20 (21 de octubre de 2009): 9119–27. http://dx.doi.org/10.1021/ie9001074.
Texto completoGouveia, Luis, Markus Leitner y Mario Ruthmair. "Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem". European Journal of Operational Research 262, n.º 3 (noviembre de 2017): 908–28. http://dx.doi.org/10.1016/j.ejor.2017.04.061.
Texto completoIbrahim, Abdullahi, Jeremiah Ishaya, Rabiat Abdulaziz y Sowole Samuel. "Solving some variants of vehicle routing problem with Branch-and-cut and Column generation algorithms". Open Journal of Mathematical Sciences 4, n.º 1 (8 de marzo de 2020): 63–73. http://dx.doi.org/10.30538/oms2020.0095.
Texto completoGendron, Bernard, Abilio Lucena, Alexandre Salles da Cunha y Luidi Simonetti. "Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem". INFORMS Journal on Computing 26, n.º 4 (noviembre de 2014): 645–57. http://dx.doi.org/10.1287/ijoc.2013.0589.
Texto completoPessoa, Artur Alves, Michael Poss, Ruslan Sadykov y François Vanderbeck. "Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty". Operations Research 69, n.º 3 (mayo de 2021): 739–54. http://dx.doi.org/10.1287/opre.2020.2035.
Texto completoHe, Wei, Yiyuan Cheng, Ling Xia y Feng Liu. "A New Particle Swarm Optimization-Based Method for Phase Unwrapping of MRI Data". Computational and Mathematical Methods in Medicine 2012 (2012): 1–9. http://dx.doi.org/10.1155/2012/475745.
Texto completoJ�nger, Michael y Stefan Thienel. "The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization". Software: Practice and Experience 30, n.º 11 (2000): 1325–52. http://dx.doi.org/10.1002/1097-024x(200009)30:11<1325::aid-spe342>3.0.co;2-t.
Texto completoChwatal, Andreas M. y Günther R. Raidl. "Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques". Advances in Operations Research 2011 (2011): 1–38. http://dx.doi.org/10.1155/2011/143732.
Texto completoTimofeeva, A. Yu y Yu A. Mezentsev. "Forecasting using predictor selection from a large set of highly correlated variables". Information Technology and Nanotechnology, n.º 2416 (2019): 10–18. http://dx.doi.org/10.18287/1613-0073-2019-2416-10-18.
Texto completoRostami, Borzou, Guy Desaulniers, Fausto Errico y Andrea Lodi. "Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times". Operations Research 69, n.º 2 (marzo de 2021): 436–55. http://dx.doi.org/10.1287/opre.2020.2037.
Texto completoKobeaga, Gorka, María Merino y Jose A. Lozano. "On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms". Annals of Operations Research 305, n.º 1-2 (3 de agosto de 2021): 107–36. http://dx.doi.org/10.1007/s10479-021-04210-0.
Texto completoArmbruster, Michael, Marzena Fügenschuh, Christoph Helmberg y Alexander Martin. "LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison". Mathematical Programming Computation 4, n.º 3 (15 de abril de 2012): 275–306. http://dx.doi.org/10.1007/s12532-012-0040-5.
Texto completoCherkesly, Marilène, Guy Desaulniers, Stefan Irnich y Gilbert Laporte. "Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks". European Journal of Operational Research 250, n.º 3 (mayo de 2016): 782–93. http://dx.doi.org/10.1016/j.ejor.2015.10.046.
Texto completoCosta, Alysson M., Jean-François Cordeau y Gilbert Laporte. "Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints". Networks 53, n.º 2 (17 de diciembre de 2008): 141–59. http://dx.doi.org/10.1002/net.20274.
Texto completoDesaulniers, Guy, Timo Gschwind y Stefan Irnich. "Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models". Transportation Science 54, n.º 5 (septiembre de 2020): 1170–88. http://dx.doi.org/10.1287/trsc.2020.0988.
Texto completoIshida, Yusuke, Yuki Kato, Liang Zhao, Hiroshi Nagamochi y Tatsuya Akutsu. "Branch-and-Bound Algorithms for Enumerating Treelike Chemical Graphs with Given Path Frequency Using Detachment-Cut". Journal of Chemical Information and Modeling 50, n.º 5 (26 de abril de 2010): 934–46. http://dx.doi.org/10.1021/ci900447z.
Texto completoRahmani, Arsalan y Majid Yousefikhoshbakht. "An Effective Branch-and-cut algorithm in Order to Solve the Mixed Integer Bi-level Programming". International Journal of Production Management and Engineering 5, n.º 1 (31 de enero de 2017): 1. http://dx.doi.org/10.4995/ijpme.2017.6512.
Texto completoDe Oliveira, Willy Alves y Maristela Oliveira dos Santos. "A New Branching Rule to Solve the Capacitated Lot Sizing and Scheduling Problem with Sequence Dependent Setups". TEMA (São Carlos) 18, n.º 3 (10 de enero de 2018): 515. http://dx.doi.org/10.5540/tema.2017.018.03.515.
Texto completoQiu, Yuzhuo, Liang Wang, Xiaoling Xu, Xuanjing Fang y Panos M. Pardalos. "Formulations and branch-and-cut algorithms for multi-product multi-vehicle production routing problems with startup cost". Expert Systems with Applications 98 (mayo de 2018): 1–10. http://dx.doi.org/10.1016/j.eswa.2018.01.006.
Texto completoPereira, Dilson Lucas y Alexandre Salles da Cunha. "Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem". Networks 71, n.º 1 (31 de octubre de 2017): 31–50. http://dx.doi.org/10.1002/net.21787.
Texto completoVakhania, Nodari y Frank Werner. "Branch Less, Cut More and Schedule Jobs with Release and Delivery Times on Uniform Machines". Mathematics 9, n.º 6 (16 de marzo de 2021): 633. http://dx.doi.org/10.3390/math9060633.
Texto completoHashemi Doulabi, Hossein, Gilles Pesant y Louis-Martin Rousseau. "Vehicle Routing Problems with Synchronized Visits and Stochastic Travel and Service Times: Applications in Healthcare". Transportation Science 54, n.º 4 (julio de 2020): 1053–72. http://dx.doi.org/10.1287/trsc.2019.0956.
Texto completoBouzarth, Elizabeth L., Richard J. Forrester, Kevin R. Hutson, Rahul Isaac, James Midkiff, Danny Rivers y Leonard J. Testa. "A Comparison of Algorithms for Finding an Efficient Theme Park Tour". Journal of Applied Mathematics 2018 (16 de octubre de 2018): 1–14. http://dx.doi.org/10.1155/2018/2453185.
Texto completoCherkesly, Marilène, Guy Desaulniers y Gilbert Laporte. "Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading". Transportation Science 49, n.º 4 (noviembre de 2015): 752–66. http://dx.doi.org/10.1287/trsc.2014.0535.
Texto completoPrzybylski, Maciej. "AD*-Cut: A Search-Tree Cutting Anytime Dynamic A* Algorithm". Proceedings of the International Conference on Automated Planning and Scheduling 28 (15 de junio de 2018): 494–99. http://dx.doi.org/10.1609/icaps.v28i1.13925.
Texto completoJin, Mingming, Jiongzhi Zheng y Kun He. "KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem". Proceedings of the AAAI Conference on Artificial Intelligence 38, n.º 18 (24 de marzo de 2024): 20735–42. http://dx.doi.org/10.1609/aaai.v38i18.30061.
Texto completo