{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T15:14:53Z","timestamp":1768835693857,"version":"3.49.0"},"reference-count":82,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T00:00:00Z","timestamp":1662163200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Serbian Ministry of Education, Science and Technological Developmen","award":["451-03-9\/2021-14\/200029"],"award-info":[{"award-number":["451-03-9\/2021-14\/200029"]}]},{"name":"Science Fund of Republic of Serbia","award":["451-03-9\/2021-14\/200029"],"award-info":[{"award-number":["451-03-9\/2021-14\/200029"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Blockchains (BCs) are distributed database systems, popular for their innovative, unsupervised maintenance process. They use a so-called consensus protocol to prevent inference by any third party of absolute trust. Security, privacy, consistency, and energy consumption have been identified as the main issues involved in BC maintenance. According to the recent literature, some of these issues can be formulated as combinatorial optimization (CO) problems, and this fact motivated us to consider incorporating CO approaches into a BC. In this paper, we propose the new combinatorial optimization consensus protocol (COCP) based on the proof-of-useful-work (PoUW) concept that assumes solving instances of real-life CO problems. Due to the complexity of the underlying CO problems, we have developed various types of heuristic methods, which are utilized in the COCP. Most of these methods are problem-dependent stochastic heuristic or metaheuristic methods. As is the case with the majority of consensus protocols, PoUW exhibits the property of asymmetry. It is difficult to find a solution for the considered CO problem; however, once a solution is found, its verification is straightforward. We present here a BC framework combining the two above-mentioned fields of research: BC and CO. This framework consists of improvements aiming towards developing the COCP of the PoUW type. The main advantage of this consensus protocol is the efficient utilization of computing resources (by exploring them for finding solutions of real-life CO problem instances), and the provision of a broad range of incentives for the various BC participants. We enumerate the potential benefits of the COCP with respect to its practical impacts and savings in power consumption, describing in detail an illustrative example based on part of the real-life BC network. In addition, we identify several challenges that should be resolved in order to implement a useful, secure, and efficient PoUW consensus protocol.<\/jats:p>","DOI":"10.3390\/sym14091831","type":"journal-article","created":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T09:51:09Z","timestamp":1662630669000},"page":"1831","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Proof-of-Useful-Work: BlockChain Mining by Solving Real-Life Optimization Problems"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7741-061X","authenticated-orcid":false,"given":"Milan","family":"Todorovi\u0107","sequence":"first","affiliation":[{"name":"Mathematical Institute, Serbian Academy of Sciences and Arts, 11001 Belgrade, Serbia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4575-6720","authenticated-orcid":false,"given":"Luka","family":"Matijevi\u0107","sequence":"additional","affiliation":[{"name":"Mathematical Institute, Serbian Academy of Sciences and Arts, 11001 Belgrade, Serbia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7477-1973","authenticated-orcid":false,"given":"Du\u0161an","family":"Ramljak","sequence":"additional","affiliation":[{"name":"School of Professional Graduate Studies at Great Valley, The Pennsylvania State University, Malvern, PA 19355, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9561-5339","authenticated-orcid":false,"given":"Tatjana","family":"Davidovi\u0107","sequence":"additional","affiliation":[{"name":"Mathematical Institute, Serbian Academy of Sciences and Arts, 11001 Belgrade, Serbia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3607-6704","authenticated-orcid":false,"given":"Dragan","family":"Uro\u0161evi\u0107","sequence":"additional","affiliation":[{"name":"Mathematical Institute, Serbian Academy of Sciences and Arts, 11001 Belgrade, Serbia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6766-4811","authenticated-orcid":false,"given":"Tatjana","family":"Jak\u0161i\u0107 Kr\u00fcger","sequence":"additional","affiliation":[{"name":"Mathematical Institute, Serbian Academy of Sciences and Arts, 11001 Belgrade, Serbia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1222-1292","authenticated-orcid":false,"given":"\u0110or\u0111e","family":"Jovanovi\u0107","sequence":"additional","affiliation":[{"name":"Mathematical Institute, Serbian Academy of Sciences and Arts, 11001 Belgrade, Serbia"}]}],"member":"1968","published-online":{"date-parts":[[2022,9,3]]},"reference":[{"key":"ref_1","unstructured":"Nakamoto, S. (2022, May 12). Bitcoin: A Peer-To-Peer Electronic Cash System. Available online: https:\/\/nakamotoinstitute.org\/bitcoin\/."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Yli-Huumo, J., Ko, D., Choi, S., Park, S., and Smolander, K. (2016). Where is current research on blockchain technology?\u2014A systematic review. PLoS ONE, 11.","DOI":"10.1371\/journal.pone.0163477"},{"key":"ref_3","unstructured":"Erbguth, J. (2022, May 19). Literature Review on Blockchain and Democracy. Available online: https:\/\/www.academia.edu\/39122357\/_Blockchain_and_democracy_by_J%C3%B6rn_Erbguth."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Ali, M., Ismail, A., Elgohary, H., Darwish, S., and Mesbah, S. (2022). A Procedure for Tracing Chain of Custody in Digital Image Forensics: A Paradigm Based on Grey Hash and Blockchain. Symmetry, 14.","DOI":"10.3390\/sym14020334"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Treiblmaier, H. (2020). Toward more rigorous blockchain research: Recommendations for writing blockchain case studies. Blockchain and Distributed Ledger Technology Use Cases, Springer.","DOI":"10.1007\/978-3-030-44337-5"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Xie, S., Dai, H., Chen, X., and Wang, H. (2017, January 25\u201330). An overview of blockchain technology: Architecture, consensus, and future trends. Proceedings of the IEEE International Congress on Big Data (BigData Congress), Honolulu, HI, USA.","DOI":"10.1109\/BigDataCongress.2017.85"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"180298","DOI":"10.1098\/rsos.180298","article-title":"Towards open data blockchain analytics: A Bitcoin perspective","volume":"5","author":"McGinn","year":"2018","journal-title":"R. Soc. Open Sci."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Kiayias, A., Panagiotakos, G., and Russell, A. (2022, May 14). Ofelimos: Combinatorial Optimization via Proof-of-Useful-WorknA Provably Secure Blockchain Protocol. IACR Cryptology ePrint Archive. Available online: https:\/\/eprint.iacr.org\/2021\/1379.pdf.","DOI":"10.1007\/978-3-031-15979-4_12"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"172994","DOI":"10.1109\/ACCESS.2019.2956698","article-title":"Proof-of-search: Combining blockchain consensus formation with solving optimization problems","volume":"7","author":"Shibata","year":"2019","journal-title":"IEEE Access"},{"key":"ref_10","unstructured":"Ball, M., Rosen, A., Sabin, M., and Vasudevan, P.N. (2022, June 04). Proofs of Useful Work. IACR Cryptology ePrint Archive. Available online: https:\/\/eprint.iacr.org\/2017\/203.pdf."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Mihaljevi\u0107, M.J. (2019). A Security Enhanced Encryption Scheme and Evaluation of Its Cryptographic Security. Entropy, 21.","DOI":"10.3390\/e21070701"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"113385","DOI":"10.1016\/j.eswa.2020.113385","article-title":"A survey of blockchain consensus algorithms performance evaluation criteria","volume":"154","author":"Bamakan","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"10127","DOI":"10.1109\/ACCESS.2018.2890507","article-title":"Blockchain for AI: Review and open research challenges","volume":"7","author":"Salah","year":"2019","journal-title":"IEEE Access"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Oyinloye, D.P., Teh, J.S., Jamil, N., and Alawida, M. (2021). Blockchain Consensus: An Overview of Alternative Protocols. Symmetry, 13.","DOI":"10.3390\/sym13081363"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"102749","DOI":"10.1016\/j.ipm.2021.102749","article-title":"A novel proof of useful work for a blockchain storing transportation transactions","volume":"59","author":"Haouari","year":"2022","journal-title":"Inf. Process. Manag."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1108\/JFC-12-2016-0078","article-title":"Bitcoin transactions: A digital discovery of illicit activity on the blockchain","volume":"25","author":"Turner","year":"2018","journal-title":"J. Financ. Crime"},{"key":"ref_17","unstructured":"FBI (2012). Bitcoin Virtual Currency: Unique Features Present Distinct Challenges for Deterring Illicit Activity, Cyber Intelligence Section and Criminal Intelligence Section. Technical Report; Federal Bureau of Investigation, Report from the: Directorate of Intelligence."},{"key":"ref_18","first-page":"8","article-title":"The Silk Road, Bitcoins and the global prohibition regime on the international trade in illicit drugs: Can this storm be weathered?","volume":"2","author":"Raeesi","year":"2015","journal-title":"Glendon J. Int. Stud. D\u2019\u00c9Tudes Int. Glendon"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Meiklejohn, S., Pomarole, M., Jordan, G., Levchenko, K., McCoy, D., Voelker, G.M., and Savage, S. (2013, January 23\u201325). A fistful of bitcoins: Characterizing payments among men with no names. Proceedings of the 2013 Conference on Internet Measurement Conference, Barcelona, Spain.","DOI":"10.1145\/2504730.2504747"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Gonzalez, D., and Hayajneh, T. (2017, January 19\u201321). Detection and prevention of crypto-ransomware. Proceedings of the 2017 IEEE 8th Annual Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON), New York, NY, USA.","DOI":"10.1109\/UEMCON.2017.8249052"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Reid, F., and Harrigan, M. (2013). An Analysis of Anonymity in the Bitcoin System. Security and Privacy in Social Networks, Springer.","DOI":"10.1007\/978-1-4614-4139-7_10"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Chawathe, S.S. (2019). Clustering blockchain data. Clustering Methods for Big Data Analytics, Springer.","DOI":"10.1007\/978-3-319-97864-2_3"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"237","DOI":"10.3390\/fi5020237","article-title":"Structure and anonymity of the bitcoin transaction graph","volume":"5","author":"Ober","year":"2013","journal-title":"Future Internet"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1016\/j.future.2017.08.048","article-title":"TrustChain: A Sybil-resistant scalable blockchain","volume":"107","author":"Otte","year":"2020","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_25","unstructured":"Ramljak, D., Davidovi\u0107, T., Uro\u0161evi\u0107, D., Jak\u0161i\u0107 Kr\u00fcger, T., Matijevi\u0107, L., Todorovi\u0107, M., and Jovanovi\u0107, D. (2021, January 20\u201323). Combinatorial optimization for self contained blockchain: An example of useful synergy. Proceedings of the XLVIII Symposium on Operational Research (SYM-OP-IS 2021), Banja Kovilja\u010da, Serbia."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Drescher, D. (2017). Blockchain Basics: A Non-Technical Introduction in 25 Steps, Apress.","DOI":"10.1007\/978-1-4842-2604-9"},{"key":"ref_27","unstructured":"Lasla, N., Alsahan, L., Abdallah, M., and Younis, M. (2020). Green-PoW: An energy-efficient blockchain proof-of-work consensus algorithm. arXiv."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1016\/j.dcan.2019.12.001","article-title":"Performance analysis and comparison of PoW, PoS and DAG based blockchains","volume":"6","author":"Cao","year":"2020","journal-title":"Digit. Commun. Netw."},{"key":"ref_29","unstructured":"King, S. (2022, June 12). Primecoin: Cryptocurrency with Prime Number Proof-of-Work. Available online: https:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.694.5890&rep=rep1&type=pdf."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Tromp, J. (2015, January 26\u201330). Cuckoo cycle: A memory bound graph-theoretic proof-of-work. Proceedings of the International Conference on Financial Cryptography and Data Security, San Juan, Puerto Rico.","DOI":"10.1007\/978-3-662-48051-9_4"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5195\/ledger.2017.48","article-title":"Equihash: Asymmetric proof-of-work based on the generalized birthday problem","volume":"2","author":"Biryukov","year":"2017","journal-title":"Ledger"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Aljassas, H.M.A., and Sasi, S. (2019, January 1\u20133). Performance evaluation of proof-of-work and collatz conjecture consensus algorithms. Proceedings of the 2nd International Conference on Computer Applications & Information Security (ICCAIS), Riyadh, Saudi Arabia.","DOI":"10.1109\/CAIS.2019.8769514"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Chin, Z.H., Yap, T.T.V., and Tan, I.K.T. (2022). Genetic-Algorithm-Inspired Difficulty Adjustment for Proof-of-Work Blockchains. Symmetry, 14.","DOI":"10.3390\/sym14030609"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Loe, A.F., and Quaglia, E.A. (2018, January 15). Conquering generals: An NP-hard proof of useful work. Proceedings of the 1st Workshop on Cryptocurrencies and Blockchains for Distributed Systems, Munich, Germany.","DOI":"10.1145\/3211933.3211943"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Syafruddin, W.A., Dadkhah, S., and K\u00f6ppen, M. (2019, January 10\u201313). Blockchain Scheme Based on Evolutionary Proof of Work. Proceedings of the 2019 IEEE Congress on Evolutionary Computation (CEC), Wellington, New Zealand.","DOI":"10.1109\/CEC.2019.8790128"},{"key":"ref_36","unstructured":"Li, W. (2018). Adapting Blockchain Technology for Scientific Computing. arXiv."},{"key":"ref_37","unstructured":"Lihu, A., Du, J., Barjaktarevic, I., Gerzanics, P., and Harvilla, M. (2020). A Proof of Useful Work for Artificial Intelligence on the Blockchain. arXiv."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Chenli, C., Li, B., Shi, Y., and Jung, T. (2019, January 14\u201317). Energy-recycling blockchain with proof-of-deep-learning. Proceedings of the 2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC), Seoul, Korea.","DOI":"10.1109\/BLOC.2019.8751419"},{"key":"ref_39","unstructured":"Li, B., Chenli, C., Xu, X., Shi, Y., and Jung, T. (2020). DLBC: A Deep Learning-Based Consensus in Blockchains for Deep Learning Services. arXiv."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Li, B., Chenli, C., Xu, X., Jung, T., and Shi, Y. (2019, January 16\u201320). Exploiting computation power of blockchain for biomedical image segmentation. Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition Workshops, Long Beach, CA, USA.","DOI":"10.1109\/CVPRW.2019.00339"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"12694","DOI":"10.1109\/JIOT.2020.3007650","article-title":"Networking Integrated Cloud-Edge-End in IoT: A Blockchain-Assisted Collective Q-Learning Approach","volume":"8","author":"Qiu","year":"2020","journal-title":"IEEE Internet Things J."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Baldominos, A., and Saez, Y. (2019). Coin. AI: A proof-of-useful-work scheme for blockchain-based distributed deep learning. Entropy, 21.","DOI":"10.3390\/e21080723"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Goharshady, A.K., and Pourdamghani, A. (2019, January 8\u201312). Hybrid mining: Exploiting blockchain\u2019s computational power for distributed problem solving. Proceedings of the 34th ACM\/SIGAPP Symposium on Applied Computing, Limassol, Cyprus.","DOI":"10.1145\/3297280.3297319"},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Philippopoulos, P., Ricottone, A., and Oliver, C.G. (2019). Difficulty Scaling in Proof of Work for Decentralized Problem Solving. arXiv.","DOI":"10.5195\/ledger.2020.194"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Davidovi\u0107, T., Todorovi\u0107, M., Ramljak, D., Jak\u0161i\u0107 Kr\u00fcger, T., Matijevi\u0107, L., Jovanovi\u0107, D., and Uro\u0161evi\u0107, D. (2022, January 5\u20137). COCP: Blockchain Proof-of-Useful-Work Leveraging Real-Life Applications. Proceedings of the International Conference on Blockchain Computing and Applications (BCCA 2022), San Antonio, TX, USA.","DOI":"10.1109\/BCCA55292.2022.9922117"},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Pinedo, M.L. (2012). Scheduling: Theory, Algorithms, and Systems, Springer Science & Business Media.","DOI":"10.1007\/978-1-4614-2361-4"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s10732-012-9197-3","article-title":"Bee colony optimization for scheduling independent tasks to identical processors","volume":"18","author":"Ramljak","year":"2012","journal-title":"J. Heuristics"},{"key":"ref_48","unstructured":"Frachtenberg, E., and Schwiegelshohn, U. (2010, January 23). Preface. Proceedings of the 15th Internation Workshop, JSSPP 2010, Job Scheduling Strategies for Parallel Processing, Atlanta, GA, USA."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1016\/S0377-2217(02)00726-9","article-title":"An exact algorithm for the identical parallel machine scheduling problem","volume":"152","author":"Mokotoff","year":"2004","journal-title":"Eur. J. Oper. Res."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"5300","DOI":"10.1109\/ACCESS.2018.2789678","article-title":"An Arc-Flow Model for the Makespan Minimization Problem on Identical Parallel Machines","volume":"6","author":"Mrad","year":"2018","journal-title":"IEEE Access"},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1016\/j.cie.2010.02.012","article-title":"Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems","volume":"58","author":"Unlu","year":"2010","journal-title":"Comput. Ind. Eng."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.ejor.2010.03.030","article-title":"Iterated greedy local search methods for unrelated parallel machine scheduling","volume":"207","author":"Ruiz","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10852-014-9262-z","article-title":"Partial solutions and multifit algorithm for multiprocessor scheduling","volume":"14","author":"Paletta","year":"2015","journal-title":"J. Math. Model. Algorithms Oper. Res."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"3586731","DOI":"10.1155\/2018\/3586731","article-title":"An order effect of neighborhood structures in variable neighborhood search algorithm for minimizing the makespan in an identical parallel machine scheduling","volume":"2018","author":"Alharkan","year":"2018","journal-title":"Math. Probl. Eng."},{"key":"ref_56","first-page":"348","article-title":"An improved cuckoo search algorithm for scheduling jobs on identical parallel machines","volume":"126","author":"Laha","year":"2018","journal-title":"Comput. IE"},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1504\/IJRAPIDM.2019.097033","article-title":"Optimisation of identical parallel machine scheduling problem","volume":"8","author":"Kamaraj","year":"2019","journal-title":"Int. J. Rapid Manuf."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Ostoji\u0107, D., Davidovi\u0107, T., Jak\u0161i\u0107 Kr\u00fcger, T., and Ramljak, D. (2021, January 4\u20136). Comparative Analysis of Heuristic Approaches to P||Cmax. Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, ICORES 2021, Online.","DOI":"10.5220\/0011008500003117"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"Volume 5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"ref_60","unstructured":"Stankovi\u0107, U., Matijevi\u0107, L., and Davidovi\u0107, T. (2021, January 20\u201323). Mathematical Models for the Weighted Scheduling Problem with Deadlines and Release Times. Proceedings of the XLVIII Symposium on Operational Research (SYM-OP-IS 2021), Banja Kovilja\u010da, Serbia."},{"key":"ref_61","unstructured":"Matijevi\u0107, L., Stankovi\u0107, U., and Davidovi\u0107, T. (2021, January 20\u201323). General Variable Neighborhood Search for the Weighted Scheduling Problem with Deadlines and Release Times. Proceedings of the XLVIII Symposium on Operational Research (SYM-OP-IS 2021), Banja Kovilja\u010da, Serbia."},{"key":"ref_62","doi-asserted-by":"crossref","unstructured":"Golden, B.L., Raghavan, S., and Wasil, E.A. (2008). The Vehicle Routing Problem: Latest Advances and NEW Challenges, Springer.","DOI":"10.1007\/978-0-387-77778-8"},{"key":"ref_63","doi-asserted-by":"crossref","unstructured":"Toth, P., and Vigo, D. (2002). The Vehicle Routing Problem, SIAM.","DOI":"10.1137\/1.9780898718515"},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Toth, P., and Vigo, D. (2014). Vehicle Routing: Problems, Methods, and Applications, SIAM.","DOI":"10.1137\/1.9781611973594"},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Manag. Sci."},{"key":"ref_66","unstructured":"Ilin, V., Matijevi\u0107, L., Davidovi\u0107, T., and Pardalos, P.M. (2018, January 16\u201319). Asymmetric Capacitated Vehicle Routing Problem with Time Window. Proceedings of the XLV Symposium on Operations Research (SYM-OP-IS 2018), Zlatibor, Serbia."},{"key":"ref_67","unstructured":"Matijevi\u0107, L., Davidovi\u0107, T., Ilin, V., and Pardalos, P.M. (2019, January 15\u201318). General Variable Neighborhood Search for Asymmetric Vehicle Routing Problem. Proceedings of the XLVI Symposium on Operations Research (SYM-OP-IS 2019), Kladovo, Serbia."},{"key":"ref_68","unstructured":"Matijevi\u0107, L., Ilin, V., Davidovi\u0107, T., Jak\u0161i\u0107 Kr\u00fcger, T., and Pardalos, P.M. (2020). Asymmetric Vehicle Routing Problem with Time and Capacity Constraints: Exact and Heuristic approaches, submitted."},{"key":"ref_69","first-page":"233","article-title":"A survey of the satisfiability-problems solving algorithms","volume":"5","author":"Kilani","year":"2013","journal-title":"Int. J. Adv. Intell. Paradig."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1109\/TCAD.2003.811450","article-title":"sub-SAT: A formulation for relaxed boolean satisfiability with applications in routing","volume":"22","author":"Xu","year":"2003","journal-title":"IEEE Trans.-Comput.-Aided Des. Integr. Circuits Syst."},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/opre.1040.0189","article-title":"Optimal protein structure alignment using maximum cliques","volume":"53","author":"Strickland","year":"2005","journal-title":"Oper. Res."},{"key":"ref_72","doi-asserted-by":"crossref","unstructured":"Li, C.M., and Quan, Z. (2010, January 11\u201315). An efficient branch-and-bound algorithm based on maxsat for the maximum clique problem. Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, Atlanta, GA, USA.","DOI":"10.1609\/aaai.v24i1.7536"},{"key":"ref_73","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1011203002719","article-title":"A \u201clogic-constrained\u201d knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite","volume":"20","author":"Vasquez","year":"2001","journal-title":"Comput. Optim. Appl."},{"key":"ref_74","doi-asserted-by":"crossref","unstructured":"Jose, M., and Majumdar, R. (2011, January 14\u201320). Bug-Assist: Assisting fault localization in ANSI-C programs. Proceedings of the International Conference on Computer Aided Verification, Snowbird, UT, USA.","DOI":"10.1007\/978-3-642-22110-1_40"},{"key":"ref_75","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1007\/s00607-020-00803-y","article-title":"SAT-based models for overlapping community detection in networks","volume":"102","author":"Jabbour","year":"2020","journal-title":"Computing"},{"key":"ref_76","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/s10601-013-9146-2","article-title":"Iterative and core-guided MaxSAT solving: A survey and assessment","volume":"18","author":"Morgado","year":"2013","journal-title":"Constraints"},{"key":"ref_77","unstructured":"Wood, G. (2022, May 06). Ethereum: A Secure Decentralised Generalised Transaction Ledger Berlin Version b8ffc51. Available online: https:\/\/ethereum.github.io\/yellowpaper\/paper.pdf."},{"key":"ref_78","unstructured":"(2022, May 23). Go Ethereum: Official Go Implementation of the Ethereum Protocol. Available online: https:\/\/geth.ethereum.org\/."},{"key":"ref_79","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hamadi, Y., Hoos, H.H., and Leyton-Brown, K. (2006, January 25\u201329). Performance prediction and automated tuning of randomized and parametric algorithms. Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming\u2014CP 2006, Nantes, France.","DOI":"10.1007\/11889205_17"},{"key":"ref_80","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","article-title":"Algorithm runtime prediction: Methods & evaluation","volume":"206","author":"Hutter","year":"2014","journal-title":"Artif. Intell."},{"key":"ref_81","doi-asserted-by":"crossref","unstructured":"Shalini, S., and Santhi, H. (2019, January 4\u20136). A survey on various attacks in bitcoin and cryptocurrency. Proceedings of the 2019 International Conference on Communication and Signal Processing (ICCSP), Chennai, India.","DOI":"10.1109\/ICCSP.2019.8697996"},{"key":"ref_82","doi-asserted-by":"crossref","unstructured":"Saad, M., Spaulding, J., Njilla, L., Kamhoua, C.A., Nyang, D., and Mohaisen, A. (2019). Overview of attack surfaces in blockchain. Blockchain for Distributed Systems Security, John Wiley & Sons.","DOI":"10.1002\/9781119519621.ch3"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/9\/1831\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:22:55Z","timestamp":1760142175000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/9\/1831"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,3]]},"references-count":82,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2022,9]]}},"alternative-id":["sym14091831"],"URL":"https:\/\/doi.org\/10.3390\/sym14091831","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,3]]}}}