Journal articles on the topic 'Algorithmes Branch-And-Cut'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Algorithmes Branch-And-Cut.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
Fragoso, Felipe C., Gilberto F. de Sousa Filho, and Fábio Protti. "Declawing a graph: polyhedra and Branch-and-Cut algorithms." Journal of Combinatorial Optimization 42, no. 1 (April 19, 2021): 85–124. http://dx.doi.org/10.1007/s10878-021-00736-y.
Full textCosta, Luciano, Claudio Contardo, and Guy Desaulniers. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing." Transportation Science 53, no. 4 (July 2019): 946–85. http://dx.doi.org/10.1287/trsc.2018.0878.
Full textPereira, Dilson Lucas, Michel Gendreau, and 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, no. 4 (February 2, 2015): 367–79. http://dx.doi.org/10.1002/net.21580.
Full textFouilhoux, Pierre, A. Ridha Mahjoub, Alain Quilliot, and Hélène Toussaint. "Branch-and-Cut-and-Price algorithms for the preemptive RCPSP." RAIRO - Operations Research 52, no. 2 (April 2018): 513–28. http://dx.doi.org/10.1051/ro/2018031.
Full textCalvete, Herminia I., Concepción Domínguez, Carmen Galé, Martine Labbé, and Alfredo Marín. "The rank pricing problem: Models and branch-and-cut algorithms." Computers & Operations Research 105 (May 2019): 12–31. http://dx.doi.org/10.1016/j.cor.2018.12.011.
Full textLi, Xiangyong, and Y. P. Aneja. "Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms." European Journal of Operational Research 257, no. 1 (February 2017): 25–40. http://dx.doi.org/10.1016/j.ejor.2016.07.032.
Full textDuchenne, Éric, Gilbert Laporte, and Frédéric Semet. "Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem." European Journal of Operational Research 162, no. 3 (May 2005): 700–712. http://dx.doi.org/10.1016/j.ejor.2003.09.024.
Full textArchetti, Claudia, Nicola Bianchessi, and M. Grazia Speranza. "Branch-and-cut algorithms for the split delivery vehicle routing problem." European Journal of Operational Research 238, no. 3 (November 2014): 685–98. http://dx.doi.org/10.1016/j.ejor.2014.04.026.
Full textDesaulniers, Guy, Diego Pecin, and Claudio Contardo. "Selective pricing in branch-price-and-cut algorithms for vehicle routing." EURO Journal on Transportation and Logistics 8, no. 2 (June 2019): 147–68. http://dx.doi.org/10.1007/s13676-017-0112-9.
Full textDi Summa, Marco, Andrea Grosso, and Marco Locatelli. "Branch and cut algorithms for detecting critical nodes in undirected graphs." Computational Optimization and Applications 53, no. 3 (February 9, 2012): 649–80. http://dx.doi.org/10.1007/s10589-012-9458-y.
Full textBektaş, Tolga, Güneş Erdoğan, and Stefan Røpke. "Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem." Transportation Science 45, no. 3 (August 2011): 299–316. http://dx.doi.org/10.1287/trsc.1100.0352.
Full textHintsch, Timo, Stefan Irnich, and Lone Kiilerich. "Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem." Transportation Science 55, no. 3 (May 2021): 687–705. http://dx.doi.org/10.1287/trsc.2020.1036.
Full textMunapo, Elias, Joshua Chukwuere, and Trust Tawanda. "Solving Linear Integer Models with Variable Bounding." Forecasting 5, no. 2 (May 5, 2023): 443–52. http://dx.doi.org/10.3390/forecast5020024.
Full textAdulyasak, Yossiri, Jean-François Cordeau, and Raf Jans. "Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems." INFORMS Journal on Computing 26, no. 1 (February 2014): 103–20. http://dx.doi.org/10.1287/ijoc.2013.0550.
Full textQiu, Yuzhuo, Liang Wang, Xuanjing Fang, Panos M. Pardalos, and Boris Goldengorin. "Formulations and branch-and-cut algorithms for production routing problems with time windows." Transportmetrica A: Transport Science 14, no. 8 (January 26, 2018): 669–90. http://dx.doi.org/10.1080/23249935.2018.1427157.
Full textGadegaard, Sune Lauth, Lars Relund Nielsen, and Matthias Ehrgott. "Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets." INFORMS Journal on Computing 31, no. 4 (October 2019): 790–804. http://dx.doi.org/10.1287/ijoc.2018.0846.
Full textAndreas, April K., J. Cole Smith, and Simge Küçükyavuz. "Branch-and-price-and-cut algorithms for solving the reliable h-paths problem." Journal of Global Optimization 42, no. 4 (October 30, 2007): 443–66. http://dx.doi.org/10.1007/s10898-007-9254-x.
Full textDrexl, Michael. "Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments." Networks 63, no. 1 (September 20, 2013): 119–33. http://dx.doi.org/10.1002/net.21526.
Full textSaharidis, Georgios K. D. "Review of Solution Approaches for the Symmetric Traveling Salesman Problem." International Journal of Information Systems and Supply Chain Management 7, no. 1 (January 2014): 73–87. http://dx.doi.org/10.4018/ijisscm.2014010105.
Full textChristof, T., and G. Reinelt. "Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut." Algorithmica 30, no. 4 (October 1, 2001): 597–629. http://dx.doi.org/10.1007/s00453-001-0029-3.
Full textRebennack, Steffen, Gerhard Reinelt, and Panos M. Pardalos. "A tutorial on branch and cut algorithms for the maximum stable set problem." International Transactions in Operational Research 19, no. 1-2 (January 2012): 161–99. http://dx.doi.org/10.1111/j.1475-3995.2011.00805.x.
Full textRopke, Stefan, Jean-François Cordeau, and Gilbert Laporte. "Models and branch-and-cut algorithms for pickup and delivery problems with time windows." Networks 49, no. 4 (2007): 258–72. http://dx.doi.org/10.1002/net.20177.
Full textGuimarães, Dilson Almeida, and Alexandre Salles da Cunha. "The minimum area spanning tree problem: Formulations, Benders decomposition and branch-and-cut algorithms." Computational Geometry 97 (August 2021): 101771. http://dx.doi.org/10.1016/j.comgeo.2021.101771.
Full textBicalho, Luis Henrique, Alexandre Salles da Cunha, and Abilio Lucena. "Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem." Computational Optimization and Applications 63, no. 3 (September 14, 2015): 755–92. http://dx.doi.org/10.1007/s10589-015-9788-7.
Full textWu, Hao, Hao Wen, and Yushan Zhu. "Branch-and-Cut Algorithmic Framework for 0−1 Mixed-Integer Convex Nonlinear Programs." Industrial & Engineering Chemistry Research 48, no. 20 (October 21, 2009): 9119–27. http://dx.doi.org/10.1021/ie9001074.
Full textGouveia, Luis, Markus Leitner, and Mario Ruthmair. "Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem." European Journal of Operational Research 262, no. 3 (November 2017): 908–28. http://dx.doi.org/10.1016/j.ejor.2017.04.061.
Full textIbrahim, Abdullahi, Jeremiah Ishaya, Rabiat Abdulaziz, and Sowole Samuel. "Solving some variants of vehicle routing problem with Branch-and-cut and Column generation algorithms." Open Journal of Mathematical Sciences 4, no. 1 (March 8, 2020): 63–73. http://dx.doi.org/10.30538/oms2020.0095.
Full textGendron, Bernard, Abilio Lucena, Alexandre Salles da Cunha, and Luidi Simonetti. "Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem." INFORMS Journal on Computing 26, no. 4 (November 2014): 645–57. http://dx.doi.org/10.1287/ijoc.2013.0589.
Full textPessoa, Artur Alves, Michael Poss, Ruslan Sadykov, and François Vanderbeck. "Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty." Operations Research 69, no. 3 (May 2021): 739–54. http://dx.doi.org/10.1287/opre.2020.2035.
Full textHe, Wei, Yiyuan Cheng, Ling Xia, and 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.
Full textJ�nger, Michael, and Stefan Thienel. "The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization." Software: Practice and Experience 30, no. 11 (2000): 1325–52. http://dx.doi.org/10.1002/1097-024x(200009)30:11<1325::aid-spe342>3.0.co;2-t.
Full textChwatal, Andreas M., and 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.
Full textTimofeeva, A. Yu, and Yu A. Mezentsev. "Forecasting using predictor selection from a large set of highly correlated variables." Information Technology and Nanotechnology, no. 2416 (2019): 10–18. http://dx.doi.org/10.18287/1613-0073-2019-2416-10-18.
Full textRostami, Borzou, Guy Desaulniers, Fausto Errico, and Andrea Lodi. "Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times." Operations Research 69, no. 2 (March 2021): 436–55. http://dx.doi.org/10.1287/opre.2020.2037.
Full textKobeaga, Gorka, María Merino, and Jose A. Lozano. "On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms." Annals of Operations Research 305, no. 1-2 (August 3, 2021): 107–36. http://dx.doi.org/10.1007/s10479-021-04210-0.
Full textArmbruster, Michael, Marzena Fügenschuh, Christoph Helmberg, and Alexander Martin. "LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison." Mathematical Programming Computation 4, no. 3 (April 15, 2012): 275–306. http://dx.doi.org/10.1007/s12532-012-0040-5.
Full textCherkesly, Marilène, Guy Desaulniers, Stefan Irnich, and 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, no. 3 (May 2016): 782–93. http://dx.doi.org/10.1016/j.ejor.2015.10.046.
Full textCosta, Alysson M., Jean-François Cordeau, and Gilbert Laporte. "Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints." Networks 53, no. 2 (December 17, 2008): 141–59. http://dx.doi.org/10.1002/net.20274.
Full textDesaulniers, Guy, Timo Gschwind, and Stefan Irnich. "Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models." Transportation Science 54, no. 5 (September 2020): 1170–88. http://dx.doi.org/10.1287/trsc.2020.0988.
Full textIshida, Yusuke, Yuki Kato, Liang Zhao, Hiroshi Nagamochi, and 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, no. 5 (April 26, 2010): 934–46. http://dx.doi.org/10.1021/ci900447z.
Full textRahmani, Arsalan, and 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, no. 1 (January 31, 2017): 1. http://dx.doi.org/10.4995/ijpme.2017.6512.
Full textDe Oliveira, Willy Alves, and 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, no. 3 (January 10, 2018): 515. http://dx.doi.org/10.5540/tema.2017.018.03.515.
Full textQiu, Yuzhuo, Liang Wang, Xiaoling Xu, Xuanjing Fang, and 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 (May 2018): 1–10. http://dx.doi.org/10.1016/j.eswa.2018.01.006.
Full textPereira, Dilson Lucas, and Alexandre Salles da Cunha. "Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem." Networks 71, no. 1 (October 31, 2017): 31–50. http://dx.doi.org/10.1002/net.21787.
Full textVakhania, Nodari, and Frank Werner. "Branch Less, Cut More and Schedule Jobs with Release and Delivery Times on Uniform Machines." Mathematics 9, no. 6 (March 16, 2021): 633. http://dx.doi.org/10.3390/math9060633.
Full textHashemi Doulabi, Hossein, Gilles Pesant, and Louis-Martin Rousseau. "Vehicle Routing Problems with Synchronized Visits and Stochastic Travel and Service Times: Applications in Healthcare." Transportation Science 54, no. 4 (July 2020): 1053–72. http://dx.doi.org/10.1287/trsc.2019.0956.
Full textBouzarth, Elizabeth L., Richard J. Forrester, Kevin R. Hutson, Rahul Isaac, James Midkiff, Danny Rivers, and Leonard J. Testa. "A Comparison of Algorithms for Finding an Efficient Theme Park Tour." Journal of Applied Mathematics 2018 (October 16, 2018): 1–14. http://dx.doi.org/10.1155/2018/2453185.
Full textCherkesly, Marilène, Guy Desaulniers, and 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, no. 4 (November 2015): 752–66. http://dx.doi.org/10.1287/trsc.2014.0535.
Full textPrzybylski, Maciej. "AD*-Cut: A Search-Tree Cutting Anytime Dynamic A* Algorithm." Proceedings of the International Conference on Automated Planning and Scheduling 28 (June 15, 2018): 494–99. http://dx.doi.org/10.1609/icaps.v28i1.13925.
Full textJin, Mingming, Jiongzhi Zheng, and 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, no. 18 (March 24, 2024): 20735–42. http://dx.doi.org/10.1609/aaai.v38i18.30061.
Full text