Auswahl der wissenschaftlichen Literatur zum Thema „Packing-covering“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Packing-covering" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Packing-covering":
Ghosh, S. K., und P. E. Haxell. „Packing and covering tetrahedra“. Discrete Applied Mathematics 161, Nr. 9 (Juni 2013): 1209–15. http://dx.doi.org/10.1016/j.dam.2010.05.027.
Chang, Gerard J., und George L. Nemhauser. „Covering, Packing and Generalized Perfection“. SIAM Journal on Algebraic Discrete Methods 6, Nr. 1 (Januar 1985): 109–32. http://dx.doi.org/10.1137/0606012.
Cohen, G., I. Honkala, S. Litsyn und P. Sole. „Long packing and covering codes“. IEEE Transactions on Information Theory 43, Nr. 5 (1997): 1617–19. http://dx.doi.org/10.1109/18.623161.
Alon, Noga, Yair Caro und Raphael Yuster. „Packing and covering dense graphs“. Journal of Combinatorial Designs 6, Nr. 6 (1998): 451–72. http://dx.doi.org/10.1002/(sici)1520-6610(1998)6:6<451::aid-jcd6>3.0.co;2-e.
Hojny, Christopher. „Packing, partitioning, and covering symresacks“. Discrete Applied Mathematics 283 (September 2020): 689–717. http://dx.doi.org/10.1016/j.dam.2020.03.002.
McDonald, Jessica, Gregory J. Puleo und Craig Tennenhouse. „Packing and Covering Directed Triangles“. Graphs and Combinatorics 36, Nr. 4 (11.04.2020): 1059–63. http://dx.doi.org/10.1007/s00373-020-02167-8.
Lonc, Zbigniew. „Majorization, packing, covering and matroids“. Discrete Mathematics 121, Nr. 1-3 (Oktober 1993): 151–57. http://dx.doi.org/10.1016/0012-365x(93)90548-8.
Chee, Yeow Meng, Charles J. Colbourn, Alan C. H. Ling und Richard M. Wilson. „Covering and packing for pairs“. Journal of Combinatorial Theory, Series A 120, Nr. 7 (September 2013): 1440–49. http://dx.doi.org/10.1016/j.jcta.2013.04.005.
Kwon, O.-joung, und Jean-Florent Raymond. „Packing and Covering Induced Subdivisions“. SIAM Journal on Discrete Mathematics 35, Nr. 2 (Januar 2021): 597–636. http://dx.doi.org/10.1137/18m1226166.
Gai, Ling, und Guochuan Zhang. „Hardness of lazy packing and covering“. Operations Research Letters 37, Nr. 2 (März 2009): 89–92. http://dx.doi.org/10.1016/j.orl.2008.12.007.
Dissertationen zum Thema "Packing-covering":
Bezdek, Andras. „Packing and covering problems /“. The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487266691095136.
Chen, Zhibin, und 陳智斌. „On various packing and covering problems“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B43085520.
Chen, Zhibin. „On various packing and covering problems“. Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B43085520.
Stardom, John. „Metaheuristics and the search for covering and packing arrays“. Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ61608.pdf.
Chang, Engder. „Neural computing for minimum set covering and gate-packing problems“. Case Western Reserve University School of Graduate Studies / OhioLINK, 1993. http://rave.ohiolink.edu/etdc/view?acc_num=case1056655652.
Nielsen, Torben Noerup. „Combinatorial Bin Packing Problems“. Diss., The University of Arizona, 1985. http://hdl.handle.net/10150/187536.
許眞眞 und Zhenzhen Xu. „A min-max theorem on packing and covering cycles in graphs“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B31226966.
Xu, Zhenzhen. „A min-max theorem on packing and covering cycles in graphs /“. Hong Kong : University of Hong Kong, 2002. http://sunzi.lib.hku.hk/hkuto/record.jsp?B25155301.
Bossenger, Wayne. „2D irregular strip packing at Kohler signs“. Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/96129.
ENGLISH ABSTRACT: Kohler Signs (PTY) Ltd is a sign production company located in Cape Town, South Africa. They manufacture and install signs for the City of Cape Town and private companies as well as manufacture advertisement signs to be placed on vehicles. Road signs consist of steel sheets that are cut and bent to the appropriate size and frame, and an image design, which is cut from re ective vinyl, are applied to the bent steel sheet. The image design consists of various letters, numbers and symbols which are categorised as irregular items. When these irregular items are combined in a distinctive way, with the use of di erent coloured vinyl, they convey a message to the road user which may be to yield for pedestrians crossing the street, or indicate to the road user the various highway exits that exist on the interchange ahead. These irregular items are placed upon re ective vinyl for cutting which results in vinyl o cuts that are wasted. The focus of this thesis is to minimise the waste incurred by placing these irregular items upon the vinyl in an optimal and timely manner for industry use. The vinyl printer, which cuts the irregular items out of the vinyl, consists of a xed width and is only limited in height by the vinyl itself. Thus, this problem may be described as a Two Dimensional Irregular Strip Packing Problem. These irregular items have only a few possible heights for each type of irregular item packed, which allows these irregular items to be packed as a level packing problem. The items are packed within levels as though they are regular items with the assistance of a prede ned rule-set. In this thesis various packing algorithms and image processing methodologies from the literature are researched and used to develop a new packing algorithm for this speci c problem. The newly developed algorithm is put through various benchmarks to test its performance. Some of these benchmarks are procured from Kohler Signs themselves, whereas others are randomly generated under certain conditions. These benchmarks reveal that the newly developed algorithm performs better for both the minimisation of waste and the minimisation of algorithm running time than the tried and trusted techniques utilised in industry by Kohler Signs.
AFRIKAANSE OPSOMMING: Kohler Signs (EDMS) Bpk is 'n padteken produksie maatskappy gele e in Kaapstad, Suid-Afrika. Hulle vervaardig en installeer tekens vir die Stad van Kaapstad en privaat maatskappye, sowel as advertensietekens wat op voertuie geplaas word. Padtekens bestaan uit staalplate wat gesny en gebuig word tot die toepaslike grootte en vorm. 'n Beeldontwerp, wat gesny is uit re ektiewe viniel, word vasgesit op die gebuigde staalplaat. Die beeldontwerp bestaan uit verskeie letters, getalle en simbole wat geklassi seer word as onre elmatige items. Wanneer hierdie onre elmatige items gekombineer word op 'n eiesoortige manier, met die gebruik van verskillende kleure viniel, dra hulle 'n boodskap oor aan die padgebruiker, soos byvoorbeeld om toe te gee aan voetgangers by 'n voetoorgang of dit dui aan die padgebruiker die verskillende snelweguitgange wat bestaan op die wisselaar wat voorl^e. Hierdie onre elmatige items word op re ektiewe viniel geplaas en uitgesny wat lei tot die vermorsing van stukkies viniel. Die fokus van hierdie tesis is om die onre elmatige items op 'n optimale en tydige wyse vir gebruik in industrie, op die viniel te plaas sodat die afval stukkies viniel geminimeer word. Die vinieldrukker, wat die onre elmatige items sny uit die viniel, bestaan uit 'n vaste wydte en is slegs beperk in hoogte deur die viniel self. Dus kan hierdie probleem beskryf word as 'n Twee-Dimensionele Onre elmatige Strookverpakkingsprobleem. Hierdie onre elmatige items het slegs 'n paar moontlike hoogtes vir elke tipe van onre elmatige item wat verpak word, wat dit moontlik maak om hierdie onre elmatige items te verpak as 'n strook verpakkingsprobleem. Die items word met behulp van 'n gede nieerde stel re els binne vlakke verpak asof hulle re elmatige items is. In hierdie tesis is verskeie verpakkingsalgoritmes en beeldverwerkingsmetodes van die literatuur nagevors en gebruik om 'n nuwe verpakkingsalgoritme vir hierdie spesi eke probleem te ontwikkel. Die nuut ontwikkelde algoritme se prestasie is deur middel van verskeie normbepalingsvoorbeelde getoets. Sommige van hierdie normbepalingsvoorbeelde is verkry van Kohler Signs self, terwyl ander lukraak gegenereer is onder sekere voorwaardes. Hierdie normbepalingsvoorbeelde toon dat die nuut ontwikkelde algoritme beter vaar as die beproefde tegnieke gebruik in industrie deur Kohler Signs vir beide die minimering van vermorsde viniel sowel as die minimering van die algoritme se uitvoertyd.
Song, Yongqiang. „Improved Approximation Algorithms for Geometric Packing Problems With Experimental Evaluation“. Thesis, University of North Texas, 2003. https://digital.library.unt.edu/ark:/67531/metadc4355/.
Bücher zum Thema "Packing-covering":
Rogers, C. A. Packing and covering. Cambridge: Cambridge University Press, 2008.
Böröczky, K. Finite packing and covering. Cambridge, UK: Cambridge University Press, 2004.
Cornuejols, Gerard. Combinatorial optimization: Packing and covering. Philadelphia: Society for Industrial and Applied Mathematics, 2001.
Gerardus Joannes Maria Van Wee. Covering codes, perfect codes, and codes from algebraic curves. Helmond [Netherlands]: Wibro Dissertatiedrukkerij, 1991.
Sikirić, Mathieu Dutour. Random sequential packing of cubes. Singapore: World Scientific, 2011.
Melissen, Johannes Bernardus Marinus. Packing and covering with circles =: Pakken en overdekken met cirkels : (met een samenvatting in het Nederlands). [S.l: s.n.], 1997.
Zong, Chuanming. Sphere packings. New York: Springer, 1999.
Martinet, Jacques. Les Réseaux parfaits des espaces euclidiens. Paris: Masson, 1996.
Conway, John Horton. Sphere packings, lattices, and groups. 3. Aufl. New York: Springer, 1999.
Convegno italiano di geometria integrale, probabilità geometriche e corpi convessi (5th 1995 Milan, Italy). V Convegno italiano di geometria integrale, probabilità geometriche e corpi convessi: Milano, 19-22 aprile 1995. Palermo: Sede della società, 1996.
Buchteile zum Thema "Packing-covering":
Blinovsky, Volodia. „Covering and Packing“. In Asymptotic Combinatorial Coding Theory, 41–61. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6193-4_3.
Croft, Hallard T., Kenneth J. Falconer und Richard K. Guy. „Packing and Covering“. In Unsolved Problems in Geometry, 107–30. New York, NY: Springer New York, 1991. http://dx.doi.org/10.1007/978-1-4612-0963-8_5.
Diestel, Reinhard. „Matching Covering and Packing“. In Graph Theory, 35–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-642-14279-6_2.
Diestel, Reinhard. „Matching Covering and Packing“. In Graph Theory, 35–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-53622-3_2.
Ahlswede, Rudolf. „Covering, Coloring, and Packing Hypergraphs“. In Foundations in Signal Processing, Communications and Networking, 3–55. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53139-7_1.
Karakostas, George. „Fractional Packing and Covering Problems“. In Encyclopedia of Algorithms, 326–29. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_149.
Mitchell, Joseph S. B., und Supantha Pandit. „Packing and Covering with Segments“. In WALCOM: Algorithms and Computation, 198–210. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39881-1_17.
Karakostas, George. „Fractional Packing and Covering Problems“. In Encyclopedia of Algorithms, 778–82. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_149.
Karakostas, George. „Fractional Packing and Covering Problems“. In Encyclopedia of Algorithms, 1–6. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-642-27848-8_149-2.
Csirik, János, und Gerhard J. Woeginger. „On-line packing and covering problems“. In Online Algorithms, 147–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029568.
Konferenzberichte zum Thema "Packing-covering":
Azar, Yossi, Umang Bhaskar, Lisa Fleischer und Debmalya Panigrahi. „Online Mixed Packing and Covering“. In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611973105.6.
Gadouleau, Maximilien, und Zhiyuan Yan. „Packing and covering properties of subspace codes“. In 2009 IEEE International Symposium on Information Theory - ISIT. IEEE, 2009. http://dx.doi.org/10.1109/isit.2009.5205292.
Srinivasan, Aravind. „Improved approximations of packing and covering problems“. In the twenty-seventh annual ACM symposium. New York, New York, USA: ACM Press, 1995. http://dx.doi.org/10.1145/225058.225138.
Koufogiannakis, Christos, und Neal E. Young. „Beating Simplex for Fractional Packing and Covering Linear Programs“. In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). IEEE, 2007. http://dx.doi.org/10.1109/focs.2007.4389519.
Koufogiannakis, Christos, und Neal E. Young. „Beating Simplex for Fractional Packing and Covering Linear Programs“. In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). IEEE, 2007. http://dx.doi.org/10.1109/focs.2007.62.
Young, N. E. „Sequential and parallel algorithms for mixed packing and covering“. In Proceedings 42nd IEEE Symposium on Foundations of Computer Science. IEEE, 2001. http://dx.doi.org/10.1109/sfcs.2001.959930.
Azar, Yossi, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang et al. „Online Algorithms for Covering and Packing Problems with Convex Objectives“. In 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2016. http://dx.doi.org/10.1109/focs.2016.24.
Benko, Attila, Gyorgy Dosa und Zsolt Tuza. „Bin Packing/Covering with Delivery, solved with the evolution of algorithms“. In 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA). IEEE, 2010. http://dx.doi.org/10.1109/bicta.2010.5645312.
Mount, David, und Ruth Silverman. „Algorithms for covering and packing and applications to CAD/CAM (abstract only)“. In the 15th annual conference. New York, New York, USA: ACM Press, 1987. http://dx.doi.org/10.1145/322917.323100.
Megow, Nicole, und Julian Mestre. „Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints“. In the 4th conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2422436.2422490.
Berichte der Organisationen zum Thema "Packing-covering":
Balas, E., G. Cornuejols und J. N. Hooker. Covering, Packing and Logical Inference. Fort Belvoir, VA: Defense Technical Information Center, Oktober 1993. http://dx.doi.org/10.21236/ada274314.