Literatura académica sobre el tema "Combinatorial exchange"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Combinatorial exchange".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Combinatorial exchange"
Lubin, B., A. I. Juda, R. Cavallo, S. Lahaie, J. Shneidman y D. C. Parkes. "ICE: An Expressive Iterative Combinatorial Exchange". Journal of Artificial Intelligence Research 33 (22 de septiembre de 2008): 33–77. http://dx.doi.org/10.1613/jair.2440.
Texto completoFaigle, Ulrich. "Exchange properties of combinatorial closure spaces". Discrete Applied Mathematics 15, n.º 2-3 (noviembre de 1986): 249–60. http://dx.doi.org/10.1016/0166-218x(86)90046-6.
Texto completoKamra, Nitin, T. K. Satish Kumar y Nora Ayanian. "Combinatorial Problems in Multirobot Battery Exchange Systems". IEEE Transactions on Automation Science and Engineering 15, n.º 2 (abril de 2018): 852–62. http://dx.doi.org/10.1109/tase.2017.2767379.
Texto completoHoffman, Karla y Dinesh Menon. "A Practical Combinatorial Clock Exchange for Spectrum Licenses". Decision Analysis 7, n.º 1 (marzo de 2010): 58–77. http://dx.doi.org/10.1287/deca.1090.0169.
Texto completoLiebling, T. M. "Large Scale Combinatorial Optimization Problems: Randomized Exchange Heuristics". IFAC Proceedings Volumes 20, n.º 9 (agosto de 1987): 73–80. http://dx.doi.org/10.1016/s1474-6670(17)55683-9.
Texto completoSchwind, Michael, Oleg Gujo y Jens Vykoukal. "A combinatorial intra-enterprise exchange for logistics services". Information Systems and e-Business Management 7, n.º 4 (15 de noviembre de 2008): 447–71. http://dx.doi.org/10.1007/s10257-008-0102-4.
Texto completoMcElfresh, Duncan C., Hoda Bidkhori y John P. Dickerson. "Scalable Robust Kidney Exchange". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 de julio de 2019): 1077–84. http://dx.doi.org/10.1609/aaai.v33i01.33011077.
Texto completoPellegrini, Paola, Lorenzo Castelli y Raffaele Pesenti. "Secondary trading of airport slots as a combinatorial exchange". Transportation Research Part E: Logistics and Transportation Review 48, n.º 5 (septiembre de 2012): 1009–22. http://dx.doi.org/10.1016/j.tre.2012.03.004.
Texto completoIvanisevic, Albena, Kim V. McCumber y Chad A. Mirkin. "Site-Directed Exchange Studies with Combinatorial Libraries of Nanostructures". Journal of the American Chemical Society 124, n.º 40 (octubre de 2002): 11997–2001. http://dx.doi.org/10.1021/ja0203871.
Texto completoBichler, Martin, Vladimir Fux y Jacob K. Goeree. "Designing combinatorial exchanges for the reallocation of resource rights". Proceedings of the National Academy of Sciences 116, n.º 3 (31 de diciembre de 2018): 786–91. http://dx.doi.org/10.1073/pnas.1802123116.
Texto completoTesis sobre el tema "Combinatorial exchange"
Sharma, Dushyant 1975. "Cyclic exchange and related neighborhood structures for combinatorial optimization problems". Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/8526.
Texto completoIncludes bibliographical references (p. 122-126).
In this thesis, we concentrate on neighborhood search algorithms based on very large-scale neighborhood structures. The thesis consists of three parts. In the first part, we develop a cyclic exchange neighborhood search based approach for partitioning problems. A partitioning problem is to divide a set of n elements into K subsets S1,... ,SK so as to minimize f(S1)+...+f(SK) for some specified function f. A partition S'1,.. ,S'K is called a cyclic exchange neighbor of the partition S1,...,SK if [...]. The problem of searching the cyclic exchange neighborhood is NP-hard. We develop new exact and heuristic algorithms to search this neighborhood structure. We propose cyclic exchange based neighborhood search algorithms for specific partitioning problems. We provide computational results on these problems indicating that the cyclic exchange is very effective and can be implemented efficiently in practice. The second part deals with the Combined Through and Fleet Assignment Model (ctFAM). This model integrates two airline planning models: (i) Fleet Assignment Model and (ii) Through Assignment Model, which are currently solved in a sequential manner because the combined problem is too large. This leads to sub-optimal solutions for the combined problem we develop very large-scale neighborhood search algorithms for the ctFAM. We also extend our neighborhood search algorithms to solve the multi-criteria objective function version of the ctFAM. Our computational results using real-life data show that neighborhood search can be a useful supplement to the current integer-programming optimization methods in airline scheduling.
(cont.) In the third part, we investigate the structure of neighborhoods in general. We call two neighborhood structures LO-equivalent if they have the same set of local optima for all instances of a combinatorial optimization problem. We define the extended neighborhood of a neighborhood structure N as the largest neighborhood structure that is LO-equivalent to N. In this thesis, we develop some theoretical properties of the extended neighborhood and relate these properties to the performance of a neighborhood structure. In particular, we show that the well-known 2-opt neighborhood structure for the Traveling Salesman Problem has a very large extended neighborhood, providing justification for its favorable empirical performance.
by Dushyant Sharma.
Ph.D.
Kumar, Deepak. "Thin film growth by combinatorial epitaxy for electronic and energy applications". Thesis, Normandie, 2019. http://www.theses.fr/2019NORMC255.
Texto completoTransition-metal oxides with an ABO3 perovskite structure exhibit strongly entangled structural and electronic degrees of freedom and thus, one expects to unveil exotic phases and properties by acting on the lattice through various external stimuli. The epitaxial strain engineering in oxide thin films is an important mean to tailor the crystal lattice distortion through cooperative Jahn Teller effect. Using the Jahn Teller active PrVO3 thin films as a model system, the structural correlation with the magnetism is established. We impose different strength of epitaxial strain in PrVO3 thin films via different means, such as, using various commercially available single crystal substrates, film thickness, substrates with different crystal surface orientations, etcetera. As a result, new and hidden phases that are absent in the bulk compound, begin to appear. Namely, the compressive strain in PrVO3 films enhances the super-exchange interaction leading to an increased antiferromagnetic Neel temperature, a strong magnetic anisotropy in PrVO3 thin films grown on (001)-, (110)- and (111)-oriented SrTiO3 substrates, are few examples
Zapata, Pedro José. "High throughput study of fuel cell proton exchange membranes: poly(vinylidene fluoride)/acrylic polyelectrolyte blends and nanocomposites with zirconium". Diss., Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/33991.
Texto completoEwe, Hendrik [Verfasser]. "Combinatorial Exchanges in Freight Logistics / Hendrik Ewe". München : Verlag Dr. Hut, 2012. http://d-nb.info/1025821289/34.
Texto completoLawson, John William. "On the combinatorics of quivers, mutations and cluster algebra exchange graphs". Thesis, Durham University, 2017. http://etheses.dur.ac.uk/12095/.
Texto completoStebila, Douglas. "Classical Authenticated Key Exchange and Quantum Cryptography". Thesis, 2009. http://hdl.handle.net/10012/4295.
Texto completoLibros sobre el tema "Combinatorial exchange"
Goldberg, Andrew V. Combinatorial algorithms for the generalized circulation problem. Stanford, Calif: Dept. of Computer Science, Stanford University, 1988.
Buscar texto completoSchwartz, Richard Evan. The Plaid Model. Princeton University Press, 2019. http://dx.doi.org/10.23943/princeton/9780691181387.001.0001.
Texto completoCapítulos de libros sobre el tema "Combinatorial exchange"
Polak, Ido. "The Incentive Ratio in Exchange Economies". En Combinatorial Optimization and Applications, 685–92. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-48749-6_49.
Texto completoMurota, Kazuo. "Convexity and Steinitz's exchange property". En Integer Programming and Combinatorial Optimization, 260–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61310-2_20.
Texto completoTanner, Andreas y Gero Mühl. "A Combinatorial Exchange for Autonomous Traders". En E-Commerce and Web Technologies, 26–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45229-4_4.
Texto completoMoßmann, Melanie, Jochen Stößer, Adam Ouorou, Eric Gourdin, Ruby Krishnaswamy y Dirk Neumann. "A Combinatorial Exchange for Complex Grid Services". En Economic Models and Algorithms for Distributed Systems, 221–37. Basel: Birkhäuser Basel, 2009. http://dx.doi.org/10.1007/978-3-7643-8899-7_13.
Texto completoBabaioff, Moshe, Patrick Briest y Piotr Krysta. "On the Approximability of Combinatorial Exchange Problems". En Algorithmic Game Theory, 83–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-79309-0_9.
Texto completoZhang, Jiawei, Bo Chen y Yinyu Ye. "A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem". En Integer Programming and Combinatorial Optimization, 219–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-25960-2_17.
Texto completoBlocho, Miroslaw y Jakub Nalepa. "LCS-Based Selective Route Exchange Crossover for the Pickup and Delivery Problem with Time Windows". En Evolutionary Computation in Combinatorial Optimization, 124–40. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-55453-2_9.
Texto completoLee, Jon, Maxim Sviridenko y Jan Vondrák. "Submodular Maximization over Multiple Matroids via Generalized Exchange Properties". En Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 244–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03685-9_19.
Texto completoHe, Xiaoxian, Yunlong Zhu, Kunyuan Hu y Ben Niu. "Route-Exchange Algorithm for Combinatorial Optimization Based on Swarm Intelligence". En Computational Intelligence and Bioinformatics, 192–200. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11816102_21.
Texto completoMehlhorn, Kurt. "On the Implementation of Combinatorial Algorithms for the Linear Exchange Market". En Algorithms, Probability, Networks, and Games, 87–94. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24024-4_7.
Texto completoActas de conferencias sobre el tema "Combinatorial exchange"
Chekuri, Chandra, Jan Vondrak y Rico Zenklusen. "Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures". En 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2010. http://dx.doi.org/10.1109/focs.2010.60.
Texto completo"COMEX: COMBINATORIAL AUCTIONS FOR THE INTRA-ENTERPRISE EXCHANGE OF LOGISTICS SERVICES". En 9th International Conference on Enterprise Information Systems. SciTePress - Science and and Technology Publications, 2007. http://dx.doi.org/10.5220/0002351500050012.
Texto completoGujo, Oleg, Michael Schwind y Jens Vykoukal. "The Design of Incentives in a Combinatorial Exchange for Intra-Enterprise Logistics Services". En The 9th IEEE International Conference on E-Commerce Technology and The 4th IEEE International Conference on Enterprise Computing, E-Commerce and E-Services (CEC-EEE 2007). IEEE, 2007. http://dx.doi.org/10.1109/cec-eee.2007.96.
Texto completoSfeir, Neyla Antoine, Hideo Fujimoto y Akira Iwata. "A Multi-Agent Interactive Approach to Assembly Modeling". En ASME 1998 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/detc98/flex-6010.
Texto completoBoonjing, Veera y Laor Boongasame. "Combinatorial Portfolio Selection with the ELECTRE III method: Case study of the Stock Exchange of Thailand (SET)". En 2016 Federated Conference on Computer Science and Information Systems. IEEE, 2016. http://dx.doi.org/10.15439/2016f228.
Texto completoSzykman, Simon y Jonathan Cagan. "Automated Generation of Optimally Directed Three Dimensional Component Layouts". En ASME 1993 Design Technical Conferences. American Society of Mechanical Engineers, 1993. http://dx.doi.org/10.1115/detc1993-0343.
Texto completoKothari, Anshul, Tuomas Sandholm y Subhash Suri. "Solving combinatorial exchanges". En the 4th ACM conference. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/779928.779976.
Texto completoFujita, Kikuo y Masayuki Kawamoto. "Hierarchical Optimization-Based Approach for Two-Dimensional Rectangular Layout Design Problems". En ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/detc2009-87410.
Texto completoBiswas, Shantanu y Y. Narahari. "Approximately Efficient Iterative Mechanisms for Combinatorial Exchanges". En 2009 IEEE Conference on Commerce and Enterprise Computing (CEC). IEEE, 2009. http://dx.doi.org/10.1109/cec.2009.61.
Texto completoBiswas, Shantanu y Y. Narahari. "Tâtonnement Mechanisms for Combinatorial Exchanges". En 2010 IEEE 12th Conference on Commerce and Enterprise Computing (CEC). IEEE, 2010. http://dx.doi.org/10.1109/cec.2010.24.
Texto completo