Journal articles on the topic 'Combinatorial optimisation problems'
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 'Combinatorial optimisation problems.'
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.
Walshaw, Chris. "Multilevel Refinement for Combinatorial Optimisation Problems." Annals of Operations Research 131, no. 1-4 (October 2004): 325–72. http://dx.doi.org/10.1023/b:anor.0000039525.80601.15.
Full textBurgess, N., and M. A. Moore. "Cost distributions in large combinatorial optimisation problems." Journal of Physics A: Mathematical and General 22, no. 21 (November 7, 1989): 4599–609. http://dx.doi.org/10.1088/0305-4470/22/21/022.
Full textDE FARIAS, I. R., E. L. JOHNSON, and G. L. NEMHAUSER. "Branch-and-cut for combinatorial optimization problems without auxiliary binary variables." Knowledge Engineering Review 16, no. 1 (March 2001): 25–39. http://dx.doi.org/10.1017/s0269888901000030.
Full textTurky, Ayad, Nasser R. Sabar, Simon Dunstall, and Andy Song. "Hyper-heuristic local search for combinatorial optimisation problems." Knowledge-Based Systems 205 (October 2020): 106264. http://dx.doi.org/10.1016/j.knosys.2020.106264.
Full textDemirovi?, Emir, Peter J. Stuckey, Tias Guns, James Bailey, Christopher Leckie, Kotagiri Ramamohanarao, and Jeffrey Chan. "Dynamic Programming for Predict+Optimise." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 02 (April 3, 2020): 1444–51. http://dx.doi.org/10.1609/aaai.v34i02.5502.
Full textCeberio, Josu, Borja Calvo, Alexander Mendiburu, and Jose A. Lozano. "Multi-Objectivising Combinatorial Optimisation Problems by Means of Elementary Landscape Decompositions." Evolutionary Computation 27, no. 2 (June 2019): 291–311. http://dx.doi.org/10.1162/evco_a_00219.
Full textCabrera-Guerrero, Guillermo, Carolina Lagos, Carolina Castañeda, Franklin Johnson, Fernando Paredes, and Enrique Cabrera. "Parameter Tuning for Local-Search-Based Matheuristic Methods." Complexity 2017 (2017): 1–15. http://dx.doi.org/10.1155/2017/1702506.
Full textWang, Tianshi, Leon Wu, Parth Nobel, and Jaijeet Roychowdhury. "Solving combinatorial optimisation problems using oscillator based Ising machines." Natural Computing 20, no. 2 (May 5, 2021): 287–306. http://dx.doi.org/10.1007/s11047-021-09845-3.
Full textNahas, Nabil, and Mustapha Nourelfath. "Nonlinear threshold accepting meta-heuristic for combinatorial optimisation problems." International Journal of Metaheuristics 3, no. 4 (2014): 265. http://dx.doi.org/10.1504/ijmheur.2014.068904.
Full textKamrani, Ali K., and Ricardo Gonzalez. "Genetic algorithms-baes solution approach to combinatorial optimisation problems." International Journal of Knowledge Management Studies 2, no. 4 (2008): 499. http://dx.doi.org/10.1504/ijkms.2008.019754.
Full textBogaerts, Bart, Stephan Gocht, Ciaran McCreesh, and Jakob Nordström. "Certified Symmetry and Dominance Breaking for Combinatorial Optimisation." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 4 (June 28, 2022): 3698–707. http://dx.doi.org/10.1609/aaai.v36i4.20283.
Full textAydin, M. Emin, and Terence C. Fogarty. "A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems." Journal of Heuristics 10, no. 3 (May 2004): 269–92. http://dx.doi.org/10.1023/b:heur.0000026896.44360.f9.
Full textJarboui, Bassem, Saber Ibrahim, Patrick Siarry, and Abdelwaheb Rebai. "A combinatorial particle swarm optimisation for solving permutation flowshop problems." Computers & Industrial Engineering 54, no. 3 (April 2008): 526–38. http://dx.doi.org/10.1016/j.cie.2007.09.006.
Full textKumar, Mohit, Samuel Kolb, Stefano Teso, and Luc De Raedt. "Learning MAX-SAT from Contextual Examples for Combinatorial Optimisation." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 04 (April 3, 2020): 4493–500. http://dx.doi.org/10.1609/aaai.v34i04.5877.
Full textAmine, Khalil. "Multiobjective Simulated Annealing: Principles and Algorithm Variants." Advances in Operations Research 2019 (May 23, 2019): 1–13. http://dx.doi.org/10.1155/2019/8134674.
Full textIsmail, A. H., N. Hartono, S. Zeybek, and D. T. Pham. "Using the Bees Algorithm to solve combinatorial optimisation problems for TSPLIB." IOP Conference Series: Materials Science and Engineering 847 (May 28, 2020): 012027. http://dx.doi.org/10.1088/1757-899x/847/1/012027.
Full textRohlfshagen, Philipp, and Xin Yao. "Dynamic combinatorial optimisation problems: an analysis of the subset sum problem." Soft Computing 15, no. 9 (June 25, 2010): 1723–34. http://dx.doi.org/10.1007/s00500-010-0616-9.
Full textFu, Y., and P. W. Anderson. "Application of statistical mechanics to NP-complete problems in combinatorial optimisation." Journal of Physics A: Mathematical and General 19, no. 9 (June 21, 1986): 1605–20. http://dx.doi.org/10.1088/0305-4470/19/9/033.
Full textKim, Yong-Hyuk, Alberto Moraglio, Ahmed Kattan, and Yourim Yoon. "Geometric Generalisation of Surrogate Model-Based Optimisation to Combinatorial and Program Spaces." Mathematical Problems in Engineering 2014 (2014): 1–10. http://dx.doi.org/10.1155/2014/184540.
Full textSiarry, P., and Y. Collette. "A tool to convert continuous multiobjective optimisation test problems into combinatorial ones." International Journal of Operational Research 3, no. 3 (2008): 281. http://dx.doi.org/10.1504/ijor.2008.017533.
Full textPastor, Rafael, and Albert Corominas. "Branch and win: OR tree search algorithms for solving combinatorial optimisation problems." Top 12, no. 1 (June 2004): 169–91. http://dx.doi.org/10.1007/bf02578930.
Full textBouhmala, Noureddine. "A variable neighbourhood search structure based-genetic algorithm for combinatorial optimisation problems." International Journal of Intelligent Systems Technologies and Applications 15, no. 2 (2016): 127. http://dx.doi.org/10.1504/ijista.2016.076494.
Full textVincenti, Angela, Mohammad Reza Ahmadian, and Paolo Vannucci. "BIANCA: a genetic algorithm to solve hard combinatorial optimisation problems in engineering." Journal of Global Optimization 48, no. 3 (December 20, 2009): 399–421. http://dx.doi.org/10.1007/s10898-009-9503-2.
Full textMoser, I., M. Gheorghita, and A. Aleti. "Identifying Features of Fitness Landscapes and Relating Them to Problem Difficulty." Evolutionary Computation 25, no. 3 (September 2017): 407–37. http://dx.doi.org/10.1162/evco_a_00177.
Full textDeschatre, Thomas, and Joseph Mikael. "Deep combinatorial optimisation for optimal stopping time problems: application to swing options pricing." MathematicS In Action 11, no. 1 (September 27, 2022): 243–58. http://dx.doi.org/10.5802/msia.26.
Full textKwon, Oh-Jun, Won-Don Lee, and Sung-Yang Bang. "Modified mean field annealing algorithm for combinatorial optimisation problems with continuous state space." Electronics Letters 33, no. 11 (1997): 968. http://dx.doi.org/10.1049/el:19970641.
Full textRuiz, Eduardo Lalla, Jesica De Armas, Christopher Expósito Izquierdo, Belén Melián Batista, and J. Marcos Moreno Vega. "Multi-leader migrating birds optimisation: a novel nature-inspired metaheuristic for combinatorial problems." International Journal of Bio-Inspired Computation 10, no. 2 (2017): 89. http://dx.doi.org/10.1504/ijbic.2017.085890.
Full textBasseur, M., A. Liefooghe, K. Le, and E. K. Burke. "The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems." Journal of Heuristics 18, no. 2 (June 21, 2011): 263–96. http://dx.doi.org/10.1007/s10732-011-9178-y.
Full textSuh, T. J., and I. I. Esat. "Solving large scale combinatorial optimisation problems based on a divide and conquer strategy." Neural Computing & Applications 7, no. 2 (June 1998): 166–79. http://dx.doi.org/10.1007/bf01414168.
Full textEhrgott, Matthias. "Multiobjective Optimization." AI Magazine 29, no. 4 (December 28, 2008): 47. http://dx.doi.org/10.1609/aimag.v29i4.2198.
Full textJain, Nishant, Brian Coyle, Elham Kashefi, and Niraj Kumar. "Graph neural network initialisation of quantum approximate optimisation." Quantum 6 (November 17, 2022): 861. http://dx.doi.org/10.22331/q-2022-11-17-861.
Full textÖlçer, A. İ. "A hybrid approach for multi-objective combinatorial optimisation problems in ship design and shipping." Computers & Operations Research 35, no. 9 (September 2008): 2760–75. http://dx.doi.org/10.1016/j.cor.2006.12.010.
Full textBodirsky, Manuel, Marcello Mamino, and Caterina Viola. "Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation." ACM Transactions on Computational Logic 23, no. 1 (January 31, 2022): 1–35. http://dx.doi.org/10.1145/3488721.
Full textCorus, Dogan, Per Kristian Lehre, Frank Neumann, and Mojgan Pourhassan. "A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms." Evolutionary Computation 24, no. 1 (March 2016): 183–203. http://dx.doi.org/10.1162/evco_a_00147.
Full textTabar, Roham Sadeghi, Kristina Wärmefjord, and Rikard Söderberg. "A method for identification and sequence optimisation of geometry spot welds in a digital twin context." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 233, no. 16 (June 11, 2019): 5610–21. http://dx.doi.org/10.1177/0954406219854466.
Full textDiaby, Moustapha, Mark H. Karwan, and Lei Sun. "On modelling hard combinatorial optimisation problems as linear programs: refutations of the 'unconditional impossibility' claims." International Journal of Operational Research 40, no. 2 (2021): 261. http://dx.doi.org/10.1504/ijor.2021.113505.
Full textKarwan, Mark H., Lei Sun, and Moustapha Diaby. "On modelling hard combinatorial optimisation problems as linear programs: refutations of the 'unconditional impossibility' claims." International Journal of Operational Research 40, no. 2 (2021): 261. http://dx.doi.org/10.1504/ijor.2021.10035933.
Full textMalan, Katherine M., and I. Moser. "Constraint Handling Guided by Landscape Analysis in Combinatorial and Continuous Search Spaces." Evolutionary Computation 27, no. 2 (June 2019): 267–89. http://dx.doi.org/10.1162/evco_a_00222.
Full textSmith, J. E. "Estimating Meme Fitness in Adaptive Memetic Algorithms for Combinatorial Problems." Evolutionary Computation 20, no. 2 (June 2012): 165–88. http://dx.doi.org/10.1162/evco_a_00060.
Full textThiruvady, Dhananjay, Christian Blum, and Andreas T. Ernst. "Solution Merging in Matheuristics for Resource Constrained Job Scheduling." Algorithms 13, no. 10 (October 9, 2020): 256. http://dx.doi.org/10.3390/a13100256.
Full textS.W. Chai, M.R. Kamaluddin, and Mohd Fadzil Faisae Ab. Rashid. "Optimisation of vehicle routing problem with time windows using Harris Hawks optimiser." Journal of Mechanical Engineering and Sciences 16, no. 3 (September 28, 2022): 9056–65. http://dx.doi.org/10.15282/jmes.16.3.2022.08.0717.
Full textFrioux, Clémence, Simon M. Dittami, and Anne Siegel. "Using automated reasoning to explore the metabolism of unconventional organisms: a first step to explore host–microbial interactions." Biochemical Society Transactions 48, no. 3 (May 7, 2020): 901–13. http://dx.doi.org/10.1042/bst20190667.
Full textCourtois, Nicolas T., Jerzy A. Gawinecki, and Guangyan Song. "Contradiction Immunity and Guess-Then-Determine Attacks on Gost." Tatra Mountains Mathematical Publications 53, no. 1 (December 1, 2012): 65–79. http://dx.doi.org/10.2478/v10127-012-0039-3.
Full textDiaby, Moustapha, and Mark H. Karwan. "Limits to the scope of applicability of extended formulations theory for LP models of combinatorial optimisation problems." International Journal of Mathematics in Operational Research 10, no. 1 (2017): 18. http://dx.doi.org/10.1504/ijmor.2017.080739.
Full textDiaby, Moustapha, and Mark H. Karwan. "Limits to the scope of applicability of extended formulations theory for LP models of combinatorial optimisation problems." International Journal of Mathematics in Operational Research 10, no. 1 (2017): 18. http://dx.doi.org/10.1504/ijmor.2017.10000855.
Full textSadeg, Souhila, Leila Hamdad, Hadjer Chettab, Karima Benatchba, Zineb Habbas, and M.-Tahar Kechadi. "Feature selection based bee swarm meta-heuristic approach for combinatorial optimisation problems: a case-study on MaxSAT." Memetic Computing 12, no. 4 (October 22, 2020): 283–98. http://dx.doi.org/10.1007/s12293-020-00310-9.
Full textSayyaadi, Hassan, Ali Sadollah, Anupam Yadav, and Neha Yadav. "Stability and iterative convergence of water cycle algorithm for computationally expensive and combinatorial Internet shopping optimisation problems." Journal of Experimental & Theoretical Artificial Intelligence 31, no. 5 (November 27, 2018): 701–21. http://dx.doi.org/10.1080/0952813x.2018.1549109.
Full textLahsinat, Yasmine, Dalila Boughaci, and Belaid Benhamou. "Breakout variable neighbourhood search for the minimum interference frequency assignment problem." Journal of Systems and Information Technology 20, no. 4 (November 12, 2018): 468–88. http://dx.doi.org/10.1108/jsit-10-2017-0094.
Full textMunro, Lachlan J., and Douglas B. Kell. "Intelligent host engineering for metabolic flux optimisation in biotechnology." Biochemical Journal 478, no. 20 (October 21, 2021): 3685–721. http://dx.doi.org/10.1042/bcj20210535.
Full textAlyahya, Khulood, and Jonathan E. Rowe. "Landscape Analysis of a Class of NP-Hard Binary Packing Problems." Evolutionary Computation 27, no. 1 (March 2019): 47–73. http://dx.doi.org/10.1162/evco_a_00237.
Full text