Journal articles on the topic 'NP-Hard optimization 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 'NP-Hard optimization 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.
Cai, Liming, David Juedes, and Iyad Kanj. "The inapproximability of non-NP-hard optimization problems." Theoretical Computer Science 289, no. 1 (October 2002): 553–71. http://dx.doi.org/10.1016/s0304-3975(01)00343-7.
Full textKremer, Ulrich. "Optimal and Near–Optimal Solutions for Hard Compilation Problems." Parallel Processing Letters 07, no. 04 (December 1997): 371–78. http://dx.doi.org/10.1142/s0129626497000371.
Full textHidalgo-Herrero, Mercedes, Pablo Rabanal, Ismael Rodríguez, and Fernando Rubio. "Comparing Problem Solving Strategies for NP-hard Optimization Problems." Fundamenta Informaticae 124, no. 1-2 (2013): 1–25. http://dx.doi.org/10.3233/fi-2013-822.
Full textŽerovnik, Janez. "Heuristics for NP-hard optimization problems - simpler is better!?" Logistics & Sustainable Transport 6, no. 1 (November 1, 2015): 1–10. http://dx.doi.org/10.1515/jlst-2015-0006.
Full textArora, Sanjeev. "Approximation schemes for NP-hard geometric optimization problems: a survey." Mathematical Programming 97, no. 1 (July 2003): 43–69. http://dx.doi.org/10.1007/s10107-003-0438-y.
Full textToktoshov, Gulzhigit Y., Anastasiya N. Yurgenson, and Denis A. Migov. "COMPLEXITY ANALYSIS OF OPTIMIZATION PROBLEMS OF UTILITYCOMMUNICATIONS NETWORKS." T-Comm 14, no. 9 (2020): 17–23. http://dx.doi.org/10.36724/2072-8735-2020-14-9-17-23.
Full textHorng, Shih-Cheng, and Shieh-Shing Lin. "Coupling Elephant Herding with Ordinal Optimization for Solving the Stochastic Inequality Constrained Optimization Problems." Applied Sciences 10, no. 6 (March 19, 2020): 2075. http://dx.doi.org/10.3390/app10062075.
Full textHorng, Shih-Cheng, and Shieh-Shing Lin. "Embedding Ordinal Optimization into Tree–Seed Algorithm for Solving the Probabilistic Constrained Simulation Optimization Problems." Applied Sciences 8, no. 11 (November 3, 2018): 2153. http://dx.doi.org/10.3390/app8112153.
Full textYu, Fa Hong, Wei Zhi Liao, and Mei Jia Chen. "An Novel Estimation of Distribution Algorithm for TSP." Applied Mechanics and Materials 373-375 (August 2013): 1089–92. http://dx.doi.org/10.4028/www.scientific.net/amm.373-375.1089.
Full textToth, Paolo. "Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems." European Journal of Operational Research 125, no. 2 (September 2000): 222–38. http://dx.doi.org/10.1016/s0377-2217(99)00453-1.
Full textPaschos, Vangelis. "An overview on polynomial approximation of NP-hard problems." Yugoslav Journal of Operations Research 19, no. 1 (2009): 3–40. http://dx.doi.org/10.2298/yjor0901003p.
Full textWong, W. S. "Matrix representation and gradient flows for NP-hard problems." Journal of Optimization Theory and Applications 87, no. 1 (October 1995): 197–220. http://dx.doi.org/10.1007/bf02192047.
Full textManyem, Prabhu. "Syntactic expressions to express NP-hard optimization problems and problems with zero duality gap." Optimization 62, no. 9 (September 2013): 1227–46. http://dx.doi.org/10.1080/02331934.2011.625027.
Full textNemirovskii, A. "Several NP-hard problems arising in robust stability analysis." Mathematics of Control, Signals, and Systems 6, no. 2 (June 1993): 99–105. http://dx.doi.org/10.1007/bf01211741.
Full textChoi, Vicky. "Different adiabatic quantum optimization algorithms." Quantum Information and Computation 11, no. 7&8 (July 2011): 638–48. http://dx.doi.org/10.26421/qic11.7-8-7.
Full textYu, Dian, Yanrong Tao, and Yue Ma. "Solving TSP Problems with Integer Programming." Journal of Physics: Conference Series 2381, no. 1 (December 1, 2022): 012045. http://dx.doi.org/10.1088/1742-6596/2381/1/012045.
Full textSabba, Sara, and Salim Chikhi. "A Novel Evolutionary Algorithm for Multidimensional Knapsack Problem." International Journal of Operations Research and Information Systems 6, no. 2 (April 2015): 1–20. http://dx.doi.org/10.4018/ijoris.2015040101.
Full textYANG, XIAOGUANG, SHUO TAO, RONGJUN LIU, and MAOCHENG CAI. "COMPLEXITY OF SCENARIO-BASED PORTFOLIO OPTIMIZATION PROBLEM WITH VaR OBJECTIVE." International Journal of Foundations of Computer Science 13, no. 05 (October 2002): 671–79. http://dx.doi.org/10.1142/s0129054102001370.
Full textHong, Dawei, and Jean-Camille Birget. "Approximation of some NP-hard optimization problems by finite machines, in probability." Theoretical Computer Science 259, no. 1-2 (May 2001): 323–39. http://dx.doi.org/10.1016/s0304-3975(00)00016-5.
Full textZissimopoulos, V. "On the performance guarantee of neural networks for NP-hard optimization problems." Information Processing Letters 54, no. 6 (June 1995): 317–22. http://dx.doi.org/10.1016/0020-0190(95)00051-d.
Full textCoja-Oghlan, Amin. "Solving NP-hard semirandom graph problems in polynomial expected time." Journal of Algorithms 62, no. 1 (January 2007): 19–46. http://dx.doi.org/10.1016/j.jalgor.2004.07.003.
Full textKarpinski, M. "Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems." Algorithmica 30, no. 3 (January 2001): 386–97. http://dx.doi.org/10.1007/s00453-001-0012-z.
Full textBILU, YONATAN, and NATHAN LINIAL. "Are Stable Instances Easy?" Combinatorics, Probability and Computing 21, no. 5 (July 26, 2012): 643–60. http://dx.doi.org/10.1017/s0963548312000193.
Full textVerbitsky, Oleg. "On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE." Combinatorics, Probability and Computing 4, no. 2 (June 1995): 167–80. http://dx.doi.org/10.1017/s0963548300001553.
Full textAngelov, Kamen. "Main Architectures Used in ETL as a Tool, Necessary for the Integration of Data in Large Volumes - a Task in the Field of Digital Preservation of Cultural Heritage." Digital Presentation and Preservation of Cultural and Scientific Heritage 6 (September 30, 2016): 129–36. http://dx.doi.org/10.55630/dipp.2016.6.12.
Full textBehmanesh, Reza. "Nephron Algorithm Optimization." International Journal of Applied Metaheuristic Computing 7, no. 1 (January 2016): 38–64. http://dx.doi.org/10.4018/ijamc.2016010103.
Full textURAHAMA, KIICHI, and HIROSHI NISHIYUKI. "PERFORMANCE OF THE RELAXATION ALGORITHM FOR MAXIMUM-CUT PROBLEMS." Journal of Circuits, Systems and Computers 06, no. 04 (August 1996): 375–84. http://dx.doi.org/10.1142/s021812669600025x.
Full textRenjith, P., and N. Sadagopan. "Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy." International Journal of Foundations of Computer Science 33, no. 01 (October 20, 2021): 1–32. http://dx.doi.org/10.1142/s0129054121500337.
Full textRubio, Fernando, and Ismael Rodríguez. "Water-Based Metaheuristics: How Water Dynamics Can Help Us to Solve NP-Hard Problems." Complexity 2019 (April 2, 2019): 1–13. http://dx.doi.org/10.1155/2019/4034258.
Full textAlman, Sam M. "Department of Computer Science and Information Technology, College of Computer Science & Information Technology, Firat University, turkey." Qubahan Academic Journal 1, no. 1 (November 14, 2020): 46–63. http://dx.doi.org/10.48161/qaj.v1n1a8.
Full textDeb, Suash, Simon Fong, Zhonghuan Tian, Raymond K. Wong, Sabah Mohammed, and Jinan Fiaidhi. "Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm." Journal of Supercomputing 72, no. 10 (May 24, 2016): 3960–92. http://dx.doi.org/10.1007/s11227-016-1739-2.
Full textHunt, Harry B., Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, and Richard E. Stearns. "NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs." Journal of Algorithms 26, no. 2 (February 1998): 238–74. http://dx.doi.org/10.1006/jagm.1997.0903.
Full textWU, LONGSHU, QIN WANG, and XIAOBING YANG. "COMPUTATIONAL METHODS FOR LOGISTICS PROBLEMS RELATED TO OPTIMAL TREES." ANZIAM Journal 58, no. 3-4 (March 7, 2017): 333–41. http://dx.doi.org/10.1017/s1446181117000074.
Full textFattahi, Parviz, Mojdeh Shirazi Manesh, and Abdolreza Roshani. "A New Solution Seed for Job Shop Scheduling Problem." Applied Mechanics and Materials 110-116 (October 2011): 3899–905. http://dx.doi.org/10.4028/www.scientific.net/amm.110-116.3899.
Full textNallaperuma, Samadhi, Frank Neumann, and Dirk Sudholt. "Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem." Evolutionary Computation 25, no. 4 (December 2017): 673–705. http://dx.doi.org/10.1162/evco_a_00199.
Full textHoroba, Christian. "Exploring the Runtime of an Evolutionary Algorithm for the Multi-Objective Shortest Path Problem." Evolutionary Computation 18, no. 3 (September 2010): 357–81. http://dx.doi.org/10.1162/evco_a_00014.
Full textJuan, Angel Alejandro, Canan Gunes Corlu, Rafael David Tordecilla, Rocio de la Torre, and Albert Ferrer. "On the Use of Biased-Randomized Algorithms for Solving Non-Smooth Optimization Problems." Algorithms 13, no. 1 (December 25, 2019): 8. http://dx.doi.org/10.3390/a13010008.
Full textWu, Kee Rong, and Chung Wei Yeh. "Solution to the 0-1 Multidimensional Knapsack Problem Based on DNA Computation." Applied Mechanics and Materials 58-60 (June 2011): 1767–72. http://dx.doi.org/10.4028/www.scientific.net/amm.58-60.1767.
Full textGao, Lunshan. "An approximation algorithm for solving standard quadratic optimization problems." Journal of Intelligent & Fuzzy Systems 39, no. 3 (October 7, 2020): 4383–92. http://dx.doi.org/10.3233/jifs-200374.
Full textEremeev, Anton, and Julia Kovalenko. "Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II." Yugoslav Journal of Operations Research 24, no. 2 (2014): 165–86. http://dx.doi.org/10.2298/yjor131030041e.
Full textJiao, Hong Wei, Jing Ben Yin, and Yun Rui Guo. "Optimization Method for Globally Solving a Kind of Multiplicative Problems with Coefficients." Key Engineering Materials 467-469 (February 2011): 526–30. http://dx.doi.org/10.4028/www.scientific.net/kem.467-469.526.
Full textAmjad, M. K., S. I. Butt, N. Anjum, I. A. Chaudhry, Z. Faping, and M. Khan. "A layered genetic algorithm with iterative diversification for optimization of flexible job shop scheduling problems." Advances in Production Engineering & Management 15, no. 4 (December 24, 2020): 377–89. http://dx.doi.org/10.14743/apem2020.4.372.
Full textArdelean, Sebastian Mihai, and Mihai Udrescu. "Graph coloring using the reduced quantum genetic algorithm." PeerJ Computer Science 7 (January 3, 2022): e836. http://dx.doi.org/10.7717/peerj-cs.836.
Full textMehmood, Nasir, Muhammad Umer, and Ahmad Riaz. "A Survey of Recent Developments for JSSP and FJSSP Using ACO." Advanced Materials Research 816-817 (September 2013): 1133–39. http://dx.doi.org/10.4028/www.scientific.net/amr.816-817.1133.
Full textAdams, Elspeth, Miguel F. Anjos, Franz Rendl, and Angelika Wiegele. "A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems." INFOR: Information Systems and Operational Research 53, no. 1 (February 2015): 40–48. http://dx.doi.org/10.3138/infor.53.1.40.
Full textLi, Yan Cang, Juan Juan Suo, and Shu Jing Zhou. "Improved ACO for Dimensional Cutting-Stock Problem." Applied Mechanics and Materials 26-28 (June 2010): 277–80. http://dx.doi.org/10.4028/www.scientific.net/amm.26-28.277.
Full textN, Buvaneswari, and Rekha S. "Timetable Scheduling using Bipartite Graph." International Journal for Research in Applied Science and Engineering Technology 10, no. 12 (December 31, 2022): 1854–56. http://dx.doi.org/10.22214/ijraset.2022.47641.
Full textZharfi, Vahid, and Abolfazl Mirzazadeh. "A Novel Metaheuristic for Travelling Salesman Problem." Journal of Industrial Engineering 2013 (July 18, 2013): 1–5. http://dx.doi.org/10.1155/2013/347825.
Full textAlmufti, Saman. "Vibrating Particles System Algorithm: Overview, Modifications and Applications." ICONTECH INTERNATIONAL JOURNAL 6, no. 3 (September 25, 2022): 1–11. http://dx.doi.org/10.46291/icontechvol6iss3pp1-11.
Full textArroyo Montoro, Fernando, Sandra Gómez-Canaval, Karina Jiménez Vega, and Alfonso Ortega de la Puente. "A Linear Time Solution for N-Queens Problem Using Generalized Networks of Evolutionary Polarized Processors." International Journal of Foundations of Computer Science 31, no. 01 (January 2020): 7–21. http://dx.doi.org/10.1142/s0129054120400018.
Full text