Gotowa bibliografia na temat „Cut-And-Solve”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Cut-And-Solve”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Cut-And-Solve"
Nicholls, Jerome J., i Chuck Prussack. "Innovative Design and Erection Methods Solve Construction of Rock Cut Bridge". PCI Journal 42, nr 4 (1.07.1997): 42–55. http://dx.doi.org/10.15554/pcij.07011997.42.55.
Pełny tekst źródłaHayford-Acquah, Teddy, i Ben Asante. "Causes of Fiber Cut and the Recommendation to Solve the Problem". IOSR Journal of Electronics and Communication Engineering 12, nr 01 (styczeń 2017): 46–64. http://dx.doi.org/10.9790/2834-1201014664.
Pełny tekst źródłaClimer, Sharlee, i Weixiong Zhang. "Cut-and-solve: An iterative search strategy for combinatorial optimization problems". Artificial Intelligence 170, nr 8-9 (czerwiec 2006): 714–38. http://dx.doi.org/10.1016/j.artint.2006.02.005.
Pełny tekst źródłaOuaïl, Fatma Zohra, i Mohamed El-Amine Chergui. "A branch-and-cut technique to solve multiobjective integer quadratic programming problems". Annals of Operations Research 267, nr 1-2 (30.10.2017): 431–46. http://dx.doi.org/10.1007/s10479-017-2698-6.
Pełny tekst źródłaBarnhart, Cynthia, Christopher A. Hane i Pamela H. Vance. "Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems". Operations Research 48, nr 2 (kwiecień 2000): 318–26. http://dx.doi.org/10.1287/opre.48.2.318.12378.
Pełny tekst źródłaYang, Zhen, Feng Chu i Haoxun Chen. "A cut-and-solve based algorithm for the single-source capacitated facility location problem". European Journal of Operational Research 221, nr 3 (wrzesień 2012): 521–32. http://dx.doi.org/10.1016/j.ejor.2012.03.047.
Pełny tekst źródłaGadegaard, Sune Lauth, Andreas Klose i Lars Relund Nielsen. "An improved cut-and-solve algorithm for the single-source capacitated facility location problem". EURO Journal on Computational Optimization 6, nr 1 (5.04.2017): 1–27. http://dx.doi.org/10.1007/s13675-017-0084-4.
Pełny tekst źródłaDeaconu, Adrian, i Laura Ciupala. "Inverse Minimum Cut Problem with Lower and Upper Bounds". Mathematics 8, nr 9 (3.09.2020): 1494. http://dx.doi.org/10.3390/math8091494.
Pełny tekst źródłaLuo, D., P. Ge, D. Liu i H. Wang. "A combined lens design for an LED low-beam motorcycle headlight". Lighting Research & Technology 50, nr 3 (6.03.2017): 456–66. http://dx.doi.org/10.1177/1477153517697370.
Pełny tekst źródłaDe Oliveira, Willy Alves, i 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, nr 3 (10.01.2018): 515. http://dx.doi.org/10.5540/tema.2017.018.03.515.
Pełny tekst źródłaRozprawy doktorskie na temat "Cut-And-Solve"
Hu, Peng. "Stochastic and multi-criteria optimization for remanufacturing industry". Electronic Thesis or Diss., université Paris-Saclay, 2023. https://www.biblio.univ-evry.fr/theses/2023/interne/2023UPASG070.pdf.
Pełny tekst źródłaEnd-of-Life (EOL) products disassembly in remanufacturing has received extensive attention in recent years owing to their advantages in saving non-renewable resources, protecting the environment and promoting economic growth. In the existing literature, 1) most of stochastic disassembly line balancing problems assume that the probability distributions of uncertain parameters are known; 2) majority of disassembly line balancing problems focus on single product; 3) few works study the disassembly line balancing related reverse supply chain (RSC) design problems. In reality, multiple EOL products disassembly related RSC exist in remanufacturing industries, such as automobile, mobile phone, etc. To bring these research gaps, three new disassembly line balancing related problems are investigated in this thesis.Firstly, a single product disassembly line balancing problem (DLBP) with partial information of task processing times is studied, where only the mean, lower and upper bounds of task processing times are known. The objective is to minimize the disassembly cost. For the studied problem, a joint chance-constrained model is proposed. Then, a new distribution-free formulation and a second-order cone program approximation-based formulation are constructed based on problem properties. Experimental results on 7 benchmark instances and 81 randomly generated instances show the effectiveness and efficiency of the proposed approach.Secondly, a new stochastic multi-product DLBP with uncertain task processing time is addressed, where only the mean, standard deviation and upper bound of task times are available. The objective is to minimize the disassembly cost. For the problem, a joint chance-constrained model is formulated. Then, based on problem analysis, the joint chance-constrained model is approximately transformed into a distribution-free model. Subsequently, several valid inequalities and an exact lifted cut-and-solve method are designed to efficiently solve the problem. Experiments results on an illustrative example and 490 randomly generated instances demonstrate the good performances of the proposed model, valid inequalities and solution method.Finally, a novel multi-product disassembly line balancing related RSC design problem is investigated, where EOL products supply, components demand and task processing times are assumed to be uncertain. The objectives are to maximize the expected profit and minimize carbon dioxide emissions, simultaneously. For the problem, a bi-objective nonlinear two-stage stochastic programming model is formulated and approximately transformed to a linear distribution-free model based on problem properties. Then, an exact epsilon-constrained based method is proposed, in which an improved Benders decomposition is designed to solve the transformed single objective problems. Numerical experiments including one case study and 200 randomly generated instances are conducted to evaluate the performance of proposed methods. Moreover, sensitivity analysis is made to draw managerial insights
Książki na temat "Cut-And-Solve"
Giles, Geoff. Match the Views: Cut & Fold Puzzles to Imagine and Solve. Tarquin, 2003.
Znajdź pełny tekst źródłaEaster Fun Activity Book: Count, Cut, Color, Connect-The-Dots, Solve Puzzles and Mazes. Independently Published, 2021.
Znajdź pełny tekst źródłaHalloween Fun for Elsie Activity Book: Color, Cut and Glue Decorations - Connect Dots - Solve Mazes and Puzzles. Independently Published, 2019.
Znajdź pełny tekst źródłaHalloween Fun for Archie Activity Book: Color, Cut and Glue Decorations - Connect Dots - Solve Mazes and Puzzles : (Learning Is Fun and Games). Independently Published, 2019.
Znajdź pełny tekst źródłaCole, Robin. Halloween Activity Book for Kids Ages 3-8: Fun Coloring Workbook for Happy Halloween Learning, Coloring, Dot to Dot, Cut Solve and Paste for Preschoolers and Elementary School Children to Keep Little Ones Busy! Independently Published, 2021.
Znajdź pełny tekst źródłaPieper, Lindsay Parks. “One of the Most Horrid Misuses of a Scientific Method”. University of Illinois Press, 2017. http://dx.doi.org/10.5406/illinois/9780252040221.003.0007.
Pełny tekst źródłaHood, Christopher, i Rozana Himaz. A Century of Fiscal Squeeze Politics. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198779612.001.0001.
Pełny tekst źródłaCzęści książek na temat "Cut-And-Solve"
Habyarimana, Ephrem. "Future Vision, Summary and Outlook". W Big Data in Bioeconomy, 291–96. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71069-9_21.
Pełny tekst źródłaZhang, Chenyang. "Property Preservation and Act Preservation". W Win in Chinese Courts, 139–48. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-3342-6_9.
Pełny tekst źródłaMitchell, John E. "Interior point algorithms for integer programming". W Advances in Linear and Integer Programming, 223–48. Oxford University PressOxford, 1996. http://dx.doi.org/10.1093/oso/9780198538561.003.0006.
Pełny tekst źródłaBadura-Skoda, Paul, i Alfred Clayton. "J. S. Bach’s Ornaments: Some General Remarks". W Interpreting Bach at the keyboard, 306–34. Oxford University PressOxford, 1993. http://dx.doi.org/10.1093/oso/9780198161554.003.0013.
Pełny tekst źródłaYang, Kai, Zhengji Li, Chao Wan, Yihao Wan, Sence Yang i Zhenzhen Quan. "Comparison and Analysis of Pulping Process and High Pressure Water Gun Technique". W Advances in Transdisciplinary Engineering. IOS Press, 2022. http://dx.doi.org/10.3233/atde220913.
Pełny tekst źródłaMetcalf, Gilbert E. "Why Do Economists Like a Carbon Tax?" W Paying for Pollution, 35–52. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780190694197.003.0004.
Pełny tekst źródłaLela, Branimir, i Jure Krolo. "Recycling of EN AW 2011 Aluminum Chips without Remelting". W Encyclopedia of Aluminum and Its Alloys. Boca Raton: CRC Press, 2019. http://dx.doi.org/10.1201/9781351045636-140000244.
Pełny tekst źródłaShende, Vaibhav, Sunita Nandgave i Mansi Bhonsle. "Credit Card Fraud Detection Using AI". W Artificial Intelligence and Communication Technologies, 911–17. Wyd. 2023. Soft Computing Research society, 2023. http://dx.doi.org/10.52458/978-81-955020-5-9-87.
Pełny tekst źródłaKumar, Naresh, i Vittore Casarosa. "Expressing Needs of Digital Audio-Visual Applications in Different Communities of Practice for Long-Term Preservation". W Advances in Library and Information Science, 54–78. IGI Global, 2017. http://dx.doi.org/10.4018/978-1-5225-1653-8.ch004.
Pełny tekst źródłaRaksithaa, S., i Mary Rani Thomas. "Connecting Skillsets for the Employability of Students in Higher Education Across Disciplines". W Advancing Student Employability Through Higher Education, 180–98. IGI Global, 2023. http://dx.doi.org/10.4018/979-8-3693-0517-1.ch010.
Pełny tekst źródłaStreszczenia konferencji na temat "Cut-And-Solve"
Smith, Kenneth, Michael Chan, John Brandenburg, Katarina A. Jones, Shawn R. Campagna, Michael Garvin, Alan R. Templeton, Daniel Jacobson, Carlos Cruchaga i Sharlee Climer. "Predicting COVID-19 Severity Using a Cut-and-Solve Feature Selection Approach". W 2023 IEEE International Conference on Bioinformatics and Biomedicine (BIBM). IEEE, 2023. http://dx.doi.org/10.1109/bibm58861.2023.10385322.
Pełny tekst źródłaBentoumi, Isma, Fabio Furini, A. Ridha Mahjoub i Sébastien Martin. "A Branch-and-Benders-Cut Approach to Solve the Maximum Flow Blocker Problem". W 2023 9th International Conference on Control, Decision and Information Technologies (CoDIT). IEEE, 2023. http://dx.doi.org/10.1109/codit58514.2023.10284073.
Pełny tekst źródłaLam, Edward, Pierre Le Bodic, Daniel D. Harabor i Peter J. Stuckey. "Branch-and-Cut-and-Price for Multi-Agent Pathfinding". W Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/179.
Pełny tekst źródłaDuan, Shanzhong (Shawn), i Yogesh Patel. "A Hybrid Parallelizable Algorithm for Computer Simulation of the Motion Behaviors of a Branched Multibody System". W ASME 2006 International Mechanical Engineering Congress and Exposition. ASMEDC, 2006. http://dx.doi.org/10.1115/imece2006-13630.
Pełny tekst źródłaIsaev, Anatoliy Andreevich, Rustem Shafagatovich Takhautdinov, Irek Miyassarovich Yunusov, Maxim Gennadievich Novikov i Vladimir Ivanovich Malykhin. "Enhanced Oil Recovery Techniques to Develop Mature Oilfields". W SPE Annual Caspian Technical Conference. SPE, 2022. http://dx.doi.org/10.2118/212140-ms.
Pełny tekst źródłaMekada, N., M. Seino, T. Yamane i H. Nakajima. "Thermally Stabilized 1 X 4 Ti:LiNbO3 Waveguide Switch". W Integrated and Guided Wave Optics. Washington, D.C.: Optica Publishing Group, 1989. http://dx.doi.org/10.1364/igwo.1989.maa2.
Pełny tekst źródłaAntypas, I. R., i T. P. Savostina. "FINDING THE LINEAR DEPENDENCE OF THE CROSS-SECTION PROFILE FOR A UNIFORM FEEDING OF BREAD MATERIAL IN THE THRESHING PROCESS". W INNOVATIVE TECHNOLOGIES IN SCIENCE AND EDUCATION. DSTU-Print, 2020. http://dx.doi.org/10.23947/itno.2020.38-41.
Pełny tekst źródłaCoutel, S., C. H. Lamarque i S. Pernot. "Identification Method for Both Linear and Piecewise Linear Dynamical Systems". W ASME 2003 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/detc2003/vib-48625.
Pełny tekst źródłaWang, Shih-Ming, Zou-Sung Chiang i Da-Fun Chen. "Determination of Cutting Forces for Micro Milling". W ASME 2008 International Manufacturing Science and Engineering Conference collocated with the 3rd JSME/ASME International Conference on Materials and Processing. ASMEDC, 2008. http://dx.doi.org/10.1115/msec_icmp2008-72532.
Pełny tekst źródłaReis, Ney Robinson Salvi dos, i Lucia Helena Ramos de Souza. "Robotic and biomimetic: technology and sustainability". W ENSUS2023 - XI Encontro de Sustentabilidade em Projeto. Grupo de Pesquisa Virtuhab/UFSC, 2023. http://dx.doi.org/10.29183/2596-237x.ensus2023.v11.n3.p494-505.
Pełny tekst źródłaRaporty organizacyjne na temat "Cut-And-Solve"
Hoffman, Karla. Real Time Scheduling and Routing: Using Column Generation, Branch-and-Cut, and Modern Heuristics to Solve Difficult Combinatorial Optimizational Problems. Fort Belvoir, VA: Defense Technical Information Center, wrzesień 2002. http://dx.doi.org/10.21236/ada422267.
Pełny tekst źródłaGraville, B. A. PR-225-9516-R01 Hydrogen Cracking in the HAZ of High Strength Steels - Development of a Test Method. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), styczeń 1996. http://dx.doi.org/10.55274/r0011702.
Pełny tekst źródła