Articoli di riviste sul tema "Robust Combinatorial Optimization"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Vedi i top-50 articoli di riviste per l'attività di ricerca sul tema "Robust Combinatorial Optimization".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Vedi gli articoli di riviste di molte aree scientifiche e compila una bibliografia corretta.
Adjiashvili, David, Sebastian Stiller e Rico Zenklusen. "Bulk-Robust combinatorial optimization". Mathematical Programming 149, n. 1-2 (13 febbraio 2014): 361–90. http://dx.doi.org/10.1007/s10107-014-0760-6.
Kawase, Yasushi, e Hanna Sumita. "Randomized Strategies for Robust Combinatorial Optimization". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 luglio 2019): 7876–83. http://dx.doi.org/10.1609/aaai.v33i01.33017876.
Buchheim, Christoph, e Jannis Kurtz. "Min–max–min robust combinatorial optimization". Mathematical Programming 163, n. 1-2 (14 luglio 2016): 1–23. http://dx.doi.org/10.1007/s10107-016-1053-z.
Poss, Michael. "Robust combinatorial optimization with knapsack uncertainty". Discrete Optimization 27 (febbraio 2018): 88–102. http://dx.doi.org/10.1016/j.disopt.2017.09.004.
Koster, Arie M. C. A., e Michael Poss. "Special issue on: robust combinatorial optimization". EURO Journal on Computational Optimization 6, n. 3 (settembre 2018): 207–9. http://dx.doi.org/10.1007/s13675-018-0102-1.
Goerigk, Marc, e Stefan Lendl. "Robust Combinatorial Optimization with Locally Budgeted Uncertainty". Open Journal of Mathematical Optimization 2 (18 maggio 2021): 1–18. http://dx.doi.org/10.5802/ojmo.5.
Goerigk, Marc, e Stephen J. Maher. "Generating hard instances for robust combinatorial optimization". European Journal of Operational Research 280, n. 1 (gennaio 2020): 34–45. http://dx.doi.org/10.1016/j.ejor.2019.07.036.
Poss, Michael. "Robust combinatorial optimization with variable cost uncertainty". European Journal of Operational Research 237, n. 3 (settembre 2014): 836–45. http://dx.doi.org/10.1016/j.ejor.2014.02.060.
Dokka, Trivikram, Marc Goerigk e Rahul Roy. "Mixed uncertainty sets for robust combinatorial optimization". Optimization Letters 14, n. 6 (24 luglio 2019): 1323–37. http://dx.doi.org/10.1007/s11590-019-01456-3.
Kurtz, Jannis. "Robust combinatorial optimization under budgeted–ellipsoidal uncertainty". EURO Journal on Computational Optimization 6, n. 4 (8 maggio 2018): 315–37. http://dx.doi.org/10.1007/s13675-018-0097-7.
Poss, Michael. "Robust combinatorial optimization with variable budgeted uncertainty". 4OR 11, n. 1 (8 novembre 2012): 75–92. http://dx.doi.org/10.1007/s10288-012-0217-9.
Crema, Alejandro. "Min max min robust (relative) regret combinatorial optimization". Mathematical Methods of Operations Research 92, n. 2 (19 maggio 2020): 249–83. http://dx.doi.org/10.1007/s00186-020-00712-y.
Buchheim, Christoph, e Jannis Kurtz. "Robust combinatorial optimization under convex and discrete cost uncertainty". EURO Journal on Computational Optimization 6, n. 3 (settembre 2018): 211–38. http://dx.doi.org/10.1007/s13675-018-0103-0.
Chassein, André, e Marc Goerigk. "On scenario aggregation to approximate robust combinatorial optimization problems". Optimization Letters 12, n. 7 (23 ottobre 2017): 1523–33. http://dx.doi.org/10.1007/s11590-017-1206-x.
Goerigk, Marc, e Martin Hughes. "Representative scenario construction and preprocessing for robust combinatorial optimization problems". Optimization Letters 13, n. 6 (29 ottobre 2018): 1417–31. http://dx.doi.org/10.1007/s11590-018-1348-5.
Raith, Andrea, Marie Schmidt, Anita Schöbel e Lisa Thom. "Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty". European Journal of Operational Research 267, n. 2 (giugno 2018): 628–42. http://dx.doi.org/10.1016/j.ejor.2017.12.018.
Chassein, André, e Marc Goerigk. "Compromise solutions for robust combinatorial optimization with variable-sized uncertainty". European Journal of Operational Research 269, n. 2 (settembre 2018): 544–55. http://dx.doi.org/10.1016/j.ejor.2018.01.056.
Alesiani, Francesco. "Implicit Bilevel Optimization: Differentiating through Bilevel Optimization Programming". Proceedings of the AAAI Conference on Artificial Intelligence 37, n. 12 (26 giugno 2023): 14683–91. http://dx.doi.org/10.1609/aaai.v37i12.26716.
Montajabiha, Mahsa, Alireza Arshadi Khamseh e Behrouz Afshar-Nadjafi. "A robust algorithm for project portfolio selection problem using real options valuation". International Journal of Managing Projects in Business 10, n. 2 (4 aprile 2017): 386–403. http://dx.doi.org/10.1108/ijmpb-12-2015-0114.
Shahsavar, Moslem, Amir Abbas Najafi e Seyed Taghi Akhavan Niaki. "Statistical Design of Genetic Algorithms for Combinatorial Optimization Problems". Mathematical Problems in Engineering 2011 (2011): 1–17. http://dx.doi.org/10.1155/2011/872415.
Zhang , Tianyi, e Yuan Ke. "\({\ell_0}\) Optimization with Robust Non-Oracular Quantum Search". Technologies 11, n. 5 (19 ottobre 2023): 148. http://dx.doi.org/10.3390/technologies11050148.
Pessoa, Artur Alves, Michael Poss, Ruslan Sadykov e François Vanderbeck. "Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty". Operations Research 69, n. 3 (maggio 2021): 739–54. http://dx.doi.org/10.1287/opre.2020.2035.
Buchheim, Christoph, e Marianna De Santis. "An active set algorithm for robust combinatorial optimization based on separation oracles". Mathematical Programming Computation 11, n. 4 (24 aprile 2019): 755–89. http://dx.doi.org/10.1007/s12532-019-00160-8.
Yaman, Hande. "Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty". Open Journal of Mathematical Optimization 4 (5 giugno 2023): 1–7. http://dx.doi.org/10.5802/ojmo.23.
Lakhdari, Saliha, e Fateh Boutekkouk. "Optimization Trends for Wireless Network On-Chip". International Journal of Wireless Networks and Broadband Technologies 10, n. 1 (gennaio 2021): 1–31. http://dx.doi.org/10.4018/ijwnbt.2021010101.
McElfresh, Duncan C., Hoda Bidkhori e John P. Dickerson. "Scalable Robust Kidney Exchange". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 luglio 2019): 1077–84. http://dx.doi.org/10.1609/aaai.v33i01.33011077.
Buchheim, Christoph. "A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization". Discrete Applied Mathematics 285 (ottobre 2020): 591–93. http://dx.doi.org/10.1016/j.dam.2020.07.002.
Álvarez-Miranda, Eduardo, Ivana Ljubić e Paolo Toth. "A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems". 4OR 11, n. 4 (2 marzo 2013): 349–60. http://dx.doi.org/10.1007/s10288-013-0231-6.
Lee, Taehan, e Changhyun Kwon. "A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty". 4OR 12, n. 4 (8 agosto 2014): 373–78. http://dx.doi.org/10.1007/s10288-014-0270-7.
Huang, Changlong, Ling Pei e Qi Ouyang. "Research on the Cuckoo Algorithm for Flexible Workshop Scheduling Problems". Frontiers in Computing and Intelligent Systems 3, n. 1 (22 marzo 2023): 177–81. http://dx.doi.org/10.54097/fcis.v3i1.6365.
Montoya, Oscar Danilo, Walter Gil-González e Jesus C. Hernández. "Optimal Scheduling of Photovoltaic Generators in Asymmetric Bipolar DC Grids Using a Robust Recursive Quadratic Convex Approximation". Machines 11, n. 2 (28 gennaio 2023): 177. http://dx.doi.org/10.3390/machines11020177.
Patish, Uri, e Shimon Ullman. "Cakewalk Sampling". Proceedings of the AAAI Conference on Artificial Intelligence 34, n. 03 (3 aprile 2020): 2400–2407. http://dx.doi.org/10.1609/aaai.v34i03.5620.
Conde, Eduardo. "Robust minmax regret combinatorial optimization problems with a resource–dependent uncertainty polyhedron of scenarios". Computers & Operations Research 103 (marzo 2019): 97–108. http://dx.doi.org/10.1016/j.cor.2018.10.014.
Büsing, Christina, e Sabrina Schmitz. "Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints". Discrete Applied Mathematics 347 (aprile 2024): 187–213. http://dx.doi.org/10.1016/j.dam.2023.12.028.
Wang, Xinggang, Zhengdong Zhang, Yi Ma, Xiang Bai, Wenyu Liu e Zhuowen Tu. "Robust Subspace Discovery via Relaxed Rank Minimization". Neural Computation 26, n. 3 (marzo 2014): 611–35. http://dx.doi.org/10.1162/neco_a_00555.
Climent, Laura, Richard J. Wallace, Barry O'Sullivan e Eugene C. Freuder. "Extrapolating from Limited Uncertain Information in Large-Scale Combinatorial Optimization Problems to Obtain Robust Solutions". International Journal on Artificial Intelligence Tools 25, n. 01 (febbraio 2016): 1660005. http://dx.doi.org/10.1142/s0218213016600058.
Wang, Fengmin, Dachuan Xu e Chenchen Wu. "Combinatorial approximation algorithms for the robust facility location problem with penalties". Journal of Global Optimization 64, n. 3 (1 novembre 2014): 483–96. http://dx.doi.org/10.1007/s10898-014-0251-6.
Sagban, Rafid, Ku Ruhana Ku-Mahamud e Muhamad Shahbani Abu Bakar. "ACOustic: A Nature-Inspired Exploration Indicator for Ant Colony Optimization". Scientific World Journal 2015 (2015): 1–11. http://dx.doi.org/10.1155/2015/392345.
Zhou, Tao, Liang Luo, Shengchen Ji e Yuanxin He. "A Reinforcement Learning Approach to Robust Scheduling of Permutation Flow Shop". Biomimetics 8, n. 6 (7 ottobre 2023): 478. http://dx.doi.org/10.3390/biomimetics8060478.
Zhou, Guangyan, e Rui Kang. "On the Lower Bounds of (1,0)-Super Solutions for Random k-SAT". International Journal of Foundations of Computer Science 30, n. 02 (febbraio 2019): 247–54. http://dx.doi.org/10.1142/s0129054119500035.
El Majdouli, Mohamed Amine, e Abdelhakim Ameur El Imrani. "Discrete Fireworks Algorithm for Single Machine Scheduling Problems". International Journal of Applied Metaheuristic Computing 7, n. 3 (luglio 2016): 24–35. http://dx.doi.org/10.4018/ijamc.2016070102.
Li, Mingguang, Runyi Huang e Yumiao Yang. "Short-term wind speed prediction based on combinatorial prediction model". Highlights in Science, Engineering and Technology 60 (25 luglio 2023): 274–82. http://dx.doi.org/10.54097/hset.v60i.10534.
Dechter, Rina, Natalia Flerova e Radu Marinescu. "Search Algorithms for m Best Solutions for Graphical Models". Proceedings of the AAAI Conference on Artificial Intelligence 26, n. 1 (20 settembre 2021): 1895–901. http://dx.doi.org/10.1609/aaai.v26i1.8405.
Mzili, Toufik, Ilyass Mzili e Mohammed Essaid Riffi. "Artificial rat optimization with decision-making: A bio-inspired metaheuristic algorithm for solving the traveling salesman problem". Decision Making: Applications in Management and Engineering 6, n. 2 (15 ottobre 2023): 150–76. http://dx.doi.org/10.31181/dmame622023644.
Bernardini, Sara, Fabio Fagnani, Santiago Franco e Alexandra Neacsu. "A Network Flow Interpretation of Robust Goal Legibility in Path Finding". Proceedings of the International Conference on Automated Planning and Scheduling 32 (13 giugno 2022): 668–77. http://dx.doi.org/10.1609/icaps.v32i1.19856.
Rodriguez-Molins, M., M. A. Salido e F. Barber. "Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem". Mathematical Problems in Engineering 2014 (2014): 1–17. http://dx.doi.org/10.1155/2014/834927.
MESHOUL, SOUHAM, e MOHAMED BATOUCHE. "COMBINING EXTREMAL OPTIMIZATION WITH SINGULAR VALUE DECOMPOSITION FOR EFFECTIVE POINT MATCHING". International Journal of Pattern Recognition and Artificial Intelligence 17, n. 07 (novembre 2003): 1111–26. http://dx.doi.org/10.1142/s0218001403002782.
Flerova, Natalia, Radu Marinescu e Rina Dechter. "Searching for the M Best Solutions in Graphical Models". Journal of Artificial Intelligence Research 55 (12 aprile 2016): 889–952. http://dx.doi.org/10.1613/jair.4985.
Imabeppu, Takahiro, Shigeru Nakayama e Satoshi Ono. "Experimental Study on Pair Swap Strategy in Quantum-Inspired Evolutionary Algorithm". Journal of Advanced Computational Intelligence and Intelligent Informatics 13, n. 2 (20 marzo 2009): 97–108. http://dx.doi.org/10.20965/jaciii.2009.p0097.
Hedayat, A. "Developing a futuristic multi-objective optimization of the fuel management problems for the nuclear research reactors". Kerntechnik 85, n. 1 (1 dicembre 2020): 26–37. http://dx.doi.org/10.1515/kern-2020-850106.