Relevant bibliographies by topics / Combinatorial exchange

Academic literature on the topic 'Combinatorial exchange'

Author: Grafiati
Published: 11 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Combinatorial exchange.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Combinatorial exchange"

1

Lubin, B., A. I. Juda, R. Cavallo, S. Lahaie, J. Shneidman, and D. C. Parkes. "ICE: An Expressive Iterative Combinatorial Exchange." Journal of Artificial Intelligence Research 33 (September 22, 2008): 33–77. http://dx.doi.org/10.1613/jair.2440.

Full text
Abstract:
We present the design and analysis of the first fully expressive, iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language (TBBL) that is concise and expressive for CEs. Bidders specify lower and upper bounds in TBBL on their value for different trades and refine these bounds across rounds. These bounds allow price discovery and useful preference elicitation in early rounds, and allow termination with an efficient trade despite partial information on bidder valuations. All computation in the exchange is carefully optimized to exploit the structure of the bid-trees and to avoid enumerating trades. A proxied interpretation of a revealed-preference activity rule, coupled with simple linear prices, ensures progress across rounds. The exchange is fully implemented, and we give results demonstrating several aspects of its scalability and economic properties with simulated bidding strategies.
APA, Harvard, Vancouver, ISO, and other styles
2

Faigle, Ulrich. "Exchange properties of combinatorial closure spaces." Discrete Applied Mathematics 15, no. 2-3 (November 1986): 249–60. http://dx.doi.org/10.1016/0166-218x(86)90046-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kamra, Nitin, T. K. Satish Kumar, and Nora Ayanian. "Combinatorial Problems in Multirobot Battery Exchange Systems." IEEE Transactions on Automation Science and Engineering 15, no. 2 (April 2018): 852–62. http://dx.doi.org/10.1109/tase.2017.2767379.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hoffman, Karla, and Dinesh Menon. "A Practical Combinatorial Clock Exchange for Spectrum Licenses." Decision Analysis 7, no. 1 (March 2010): 58–77. http://dx.doi.org/10.1287/deca.1090.0169.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Liebling, T. M. "Large Scale Combinatorial Optimization Problems: Randomized Exchange Heuristics." IFAC Proceedings Volumes 20, no. 9 (August 1987): 73–80. http://dx.doi.org/10.1016/s1474-6670(17)55683-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Schwind, Michael, Oleg Gujo, and Jens Vykoukal. "A combinatorial intra-enterprise exchange for logistics services." Information Systems and e-Business Management 7, no. 4 (November 15, 2008): 447–71. http://dx.doi.org/10.1007/s10257-008-0102-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

McElfresh, Duncan C., Hoda Bidkhori, and John P. Dickerson. "Scalable Robust Kidney Exchange." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 1077–84. http://dx.doi.org/10.1609/aaai.v33i01.33011077.

Full text
Abstract:
In barter exchanges, participants directly trade their endowed goods in a constrained economic setting without money. Transactions in barter exchanges are often facilitated via a central clearinghouse that must match participants even in the face of uncertainty—over participants, existence and quality of potential trades, and so on. Leveraging robust combinatorial optimization techniques, we address uncertainty in kidney exchange, a real-world barter market where patients swap (in)compatible paired donors. We provide two scalable robust methods to handle two distinct types of uncertainty in kidney exchange—over the quality and the existence of a potential match. The latter case directly addresses a weakness in all stochastic-optimization-based methods to the kidney exchange clearing problem, which all necessarily require explicit estimates of the probability of a transaction existing—a still-unsolved problem in this nascent market. We also propose a novel, scalable kidney exchange formulation that eliminates the need for an exponential-time constraint generation process in competing formulations, maintains provable optimality, and serves as a subsolver for our robust approach. For each type of uncertainty we demonstrate the benefits of robustness on real data from a large, fielded kidney exchange in the United States. We conclude by drawing parallels between robustness and notions of fairness in the kidney exchange setting.
APA, Harvard, Vancouver, ISO, and other styles
8

Pellegrini, Paola, Lorenzo Castelli, and Raffaele Pesenti. "Secondary trading of airport slots as a combinatorial exchange." Transportation Research Part E: Logistics and Transportation Review 48, no. 5 (September 2012): 1009–22. http://dx.doi.org/10.1016/j.tre.2012.03.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ivanisevic, Albena, Kim V. McCumber, and Chad A. Mirkin. "Site-Directed Exchange Studies with Combinatorial Libraries of Nanostructures." Journal of the American Chemical Society 124, no. 40 (October 2002): 11997–2001. http://dx.doi.org/10.1021/ja0203871.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bichler, Martin, Vladimir Fux, and Jacob K. Goeree. "Designing combinatorial exchanges for the reallocation of resource rights." Proceedings of the National Academy of Sciences 116, no. 3 (December 31, 2018): 786–91. http://dx.doi.org/10.1073/pnas.1802123116.

Full text
Abstract:
We describe the design and implementation of a combinatorial exchange for trading catch shares in New South Wales, Australia. The exchange ended a decades-long political debate by providing a market-based response to a major policy problem faced by fisheries worldwide: the reallocation of catch shares in cap-and-trade programs designed to prevent overfishing. The exchange was conducted over the Internet to lower participation costs and allowed for all-or-nothing orders to avoid fragmented share portfolios. A subsidy was distributed endogenously to facilitate the transfer of shares from inactive to active fishers. Finally, prices were linear and anonymous to ensure that sellers of identical packages received the same payments. These features were crucial to mitigate economic distortions from introducing catch shares and to gain broad acceptance of the program. However, they led to computationally challenging allocation and pricing problems. The exchange operated from May to July 2017 and effectively reallocated shares from inactive fishers to those who needed them most: 86% of active fishers’ bids were matched and their share deficits were reduced by 95% in high-priority share classes. Similar reallocation problems arise in fisheries with catch-share systems worldwide as well as in other cap-and-trade systems for resource rights, e.g., water and pollution rights. The implemented exchange illustrates how computational optimization and market design can provide policy tools, able to solve complex policy problems considered intractable only a few years ago.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Combinatorial exchange"

1

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.

Full text
Abstract:
Thesis (Ph.D.)--Massachusetts Institute of Technology, Sloan School of Management, 2002.
Includes 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.
APA, Harvard, Vancouver, ISO, and other styles
2

Kumar, Deepak. "Thin film growth by combinatorial epitaxy for electronic and energy applications." Thesis, Normandie, 2019. http://www.theses.fr/2019NORMC255.

Full text
Abstract:
Les oxydes de métaux de transition à structure pérovskite ABO3 présentent des degrés de liberté structurels et électroniques fortement enchevêtrés. On s'attend donc à découvrir des phases et des propriétés exotiques en agissant sur le réseau par le biais de divers stimuli externes. L'ingénierie des contraintes épitaxiales dans les couches minces d'oxydes est un moyen important d'adapter la distorsion du réseau cristallin par l'effet coopératif de Jahn Teller. En utilisant les couches minces actives PrVO3 de Jahn Teller comme système modèle, la corrélation structurelle avec le magnétisme est établie. Nous imposons différentes contraintes de contrainte épitaxiale dans les films minces PrVO3 via différents moyens, tels que, en utilisant divers substrats monocristallins disponibles dans le commerce, l'épaisseur du film, des substrats avec des orientations de surface cristallines différentes, etc. En conséquence, des phases nouvelles et cachées, absentes du composé en vrac, commencent à apparaître. Notamment, la contrainte de compression dans les films de PrVO3 améliore l'interaction de super échanges menant à une augmentation de la température de Neel antiferromagnétique, une forte anisotropie magnétique dans les films minces de PrVO3 cultivés sur des substrats SrTiO3 orientés (001), 110 et 111, sont quelques exemples
Transition-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
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
Abstract:
In view of the unfavorable panorama of actual energy supply practices, alternative sustainable energy sources and conversion approaches have acquired noteworthy significance in recent years. Among these, proton exchange membrane fuel cells (PEMFCs) are being considered as a pivotal building block in the transition towards a sustainable energy economy. The proton exchange membrane (PEM) is a vital component, as well as a performance-limiting factor, of the PEMFC. Consequently, the development of high performance PEM materials is of upmost importance for the advance of the PEMFC field. In this work, alternative PEM materials based on semi-interpenetrated networks from blends of poly(vinyledene fluoride) (PVDF) and sulfonated crosslinked acrylic polyelectrolytes (PE), as well as tri-phase PVDF/PE/zirconium-based composites, are studied. To alleviate the burden resulting from the vast number of possible combinations of the different precursors utilized in the preparation of the membranes, custom high throughput screening systems have been developed for their characterization. By coupling the data spaces obtained via these systems with the appropriate statistical and data analysis tools it was found that, despite not being directly involved in the proton transport process, the inert PVDF phase plays a major role on proton conductivity. Particularly, a univocal inverse correlation between the PVDF crystalline characteristics (i.e., crystallinity and crystallite size) and melt viscosity, and membrane proton conductivity was discovered. Membranes based on highly crystalline and viscous PVDF homopolymers exhibited reduced proton conductivity due to precluded segmental motion of the PE chains during crosslinking. In addition, a maximum effective amount of PE (55-60wt%) beneficial for proton conductivity was revealed. In the case of composite membranes, despite the fact that nanoparticle dispersion was thermodynamically limited, a general improvement in proton conductivity was evidenced at low to medium nanoparticle loadings (0.5 to 1wt%) in comparison to non-hybrid PVDF/PE references. This beneficial effect was particularly noticeable in membranes based on PVDF homopolymers (7% to 14.3% increment), where the nanoparticles induced a "healing" effect by providing proton-conducting paths between non-crosslinked PE channels separated by dense PVDF areas resulting from large PVDF crystallites. In general, the results presented herein are promising for the development of new cost-effective alternative PEMs.
APA, Harvard, Vancouver, ISO, and other styles
4

Ewe, Hendrik [Verfasser]. "Combinatorial Exchanges in Freight Logistics / Hendrik Ewe." München : Verlag Dr. Hut, 2012. http://d-nb.info/1025821289/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lawson, John William. "On the combinatorics of quivers, mutations and cluster algebra exchange graphs." Thesis, Durham University, 2017. http://etheses.dur.ac.uk/12095/.

Full text
Abstract:
Over the last 20 years, cluster algebras have been widely studied, with numerous links to different areas of mathematics and physics. These algebras have a cluster structure given by successively mutating seeds, which can be thought of as living on some graph or tree. In this way one can use various combinatorial tools to discover more about these cluster structures and the cluster algebras themselves. This thesis considers some of the combinatorics at play here. Mutation-finite quivers have been classified, with links to triangulations of surfaces and semi-simple Lie algebras, while comparatively little is known about mutation-infinite quivers. We introduce a classification of the minimal types of these mutation-infinite quivers before studying their properties. We show that these minimal mutation-infinite quivers admit a maximal green sequence and that the cluster algebras which they generate are equal to their related upper cluster algebras. Automorphisms of skew-symmetric cluster algebras are known to be linked to automorphisms of their exchange graphs. In the final chapter we discuss how this idea can be extended to skew-symmetrizable cluster algebras by using the symmetrizing weights to add markings to the exchange graphs. This opens possible opportunities to study orbifold mapping class groups using combinatoric graph theory.
APA, Harvard, Vancouver, ISO, and other styles
6

Stebila, Douglas. "Classical Authenticated Key Exchange and Quantum Cryptography." Thesis, 2009. http://hdl.handle.net/10012/4295.

Full text
Abstract:
Cryptography plays an integral role in secure communication and is usually the strongest link in the chain of security. Yet security problems abound in electronic communication: spyware, phishing, denial of service, and side-channel attacks are still major concerns. The main goal in this thesis is to consider how cryptographic techniques can be extended to offer greater defence against these non-traditional security threats. In the first part of this thesis, we consider problems in classical cryptography. We introduce multi-factor password-authenticated key exchange which allows secure authentication and key agreement based on multiple short secrets, such as a long-term password and a one-time response; it can provide an enhanced level of assurance in higher security scenarios because a multi-factor protocol is designed to remain secure even if all but one of the factors has been compromised due to attacks such as phishing or spyware. Next, we consider the integration of denial of service countermeasures with key exchange protocols: by introducing a formal model for denial of service resilience that complements the extended Canetti-Krawczyk model for secure key agreement, we cover a wide range of existing denial of service attacks and prevent them by carefully using client puzzles. Additionally, we look at how side-channel attacks affect certain types of formulae used in elliptic curve cryptography, and demonstrate that information leaked during field operations such as addition, subtraction, and multiplication can be exploited by an attacker. In the second part of this thesis, we examine cryptography in the quantum setting. We argue that quantum key distribution will have an important role to play in future information security infrastructures and will operate best when integrated with the powerful public key infrastructures that are used today. Finally, we present a new look at quantum money and describe a quantum coin scheme where the coins are not easily counterfeited, are locally verifiable, and can be transferred to another party.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Combinatorial exchange"

1

Goldberg, Andrew V. Combinatorial algorithms for the generalized circulation problem. Stanford, Calif: Dept. of Computer Science, Stanford University, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Schwartz, Richard Evan. The Plaid Model. Princeton University Press, 2019. http://dx.doi.org/10.23943/princeton/9780691181387.001.0001.

Full text
Abstract:
Outer billiards provides a toy model for planetary motion and exhibits intricate and mysterious behavior even for seemingly simple examples. It is a dynamical system in which a particle in the plane moves around the outside of a convex shape according to a scheme that is reminiscent of ordinary billiards. This book provides a combinatorial model for orbits of outer billiards on kites. The book relates these orbits to such topics as polytope exchange transformations, renormalization, continued fractions, corner percolation, and the Truchet tile system. The combinatorial model, called “the plaid model,” has a self-similar structure that blends geometry and elementary number theory. The results were discovered through computer experimentation and it seems that the conclusions would be extremely difficult to reach through traditional mathematics. The book includes an extensive computer program that allows readers to explore the materials interactively and each theorem is accompanied by a computer demonstration.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Combinatorial exchange"

1

Polak, Ido. "The Incentive Ratio in Exchange Economies." In Combinatorial Optimization and Applications, 685–92. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-48749-6_49.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Murota, Kazuo. "Convexity and Steinitz's exchange property." In Integer Programming and Combinatorial Optimization, 260–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61310-2_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tanner, Andreas, and Gero Mühl. "A Combinatorial Exchange for Autonomous Traders." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Moßmann, Melanie, Jochen Stößer, Adam Ouorou, Eric Gourdin, Ruby Krishnaswamy, and Dirk Neumann. "A Combinatorial Exchange for Complex Grid Services." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Babaioff, Moshe, Patrick Briest, and Piotr Krysta. "On the Approximability of Combinatorial Exchange Problems." In Algorithmic Game Theory, 83–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-79309-0_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Jiawei, Bo Chen, and Yinyu Ye. "A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Blocho, Miroslaw, and Jakub Nalepa. "LCS-Based Selective Route Exchange Crossover for the Pickup and Delivery Problem with Time Windows." In Evolutionary Computation in Combinatorial Optimization, 124–40. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-55453-2_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lee, Jon, Maxim Sviridenko, and Jan Vondrák. "Submodular Maximization over Multiple Matroids via Generalized Exchange Properties." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

He, Xiaoxian, Yunlong Zhu, Kunyuan Hu, and Ben Niu. "Route-Exchange Algorithm for Combinatorial Optimization Based on Swarm Intelligence." In Computational Intelligence and Bioinformatics, 192–200. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11816102_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Mehlhorn, Kurt. "On the Implementation of Combinatorial Algorithms for the Linear Exchange Market." In Algorithms, Probability, Networks, and Games, 87–94. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24024-4_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Combinatorial exchange"

1

Chekuri, Chandra, Jan Vondrak, and Rico Zenklusen. "Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures." In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2010. http://dx.doi.org/10.1109/focs.2010.60.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

"COMEX: COMBINATORIAL AUCTIONS FOR THE INTRA-ENTERPRISE EXCHANGE OF LOGISTICS SERVICES." In 9th International Conference on Enterprise Information Systems. SciTePress - Science and and Technology Publications, 2007. http://dx.doi.org/10.5220/0002351500050012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gujo, Oleg, Michael Schwind, and Jens Vykoukal. "The Design of Incentives in a Combinatorial Exchange for Intra-Enterprise Logistics Services." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sfeir, Neyla Antoine, Hideo Fujimoto, and Akira Iwata. "A Multi-Agent Interactive Approach to Assembly Modeling." In ASME 1998 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/detc98/flex-6010.

Full text
Abstract:
Abstract This paper introduces a new interactive multi-agent approach to automate the assembly modeling problem in order to generate the parts precedence relations of a product starting from its design data. Assembly parts are considered as self-interested intelligent agents with local information and goals. Centralized approaches based on graphical representation resulted so far in both combinatorial and information complexity, especially when dealing with actual complex industrial products. The proposed decentralized approach overcomes exhaustive combinatorial search, while the ability to store and exchange dynamic information among agents reduces the oversimplification of graphical representation. Furthermore, the incorporation of human agents helps the system to overcome the limitations of artificial intelligence. This approach offers a promising platform for assembly planning automation with minimum human intervention especially for all-new products.
APA, Harvard, Vancouver, ISO, and other styles
5

Boonjing, Veera, and Laor Boongasame. "Combinatorial Portfolio Selection with the ELECTRE III method: Case study of the Stock Exchange of Thailand (SET)." In 2016 Federated Conference on Computer Science and Information Systems. IEEE, 2016. http://dx.doi.org/10.15439/2016f228.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Szykman, Simon, and Jonathan Cagan. "Automated Generation of Optimally Directed Three Dimensional Component Layouts." In ASME 1993 Design Technical Conferences. American Society of Mechanical Engineers, 1993. http://dx.doi.org/10.1115/detc1993-0343.

Full text
Abstract:
Abstract This research introduces a novel approach towards automating the generation of three dimensional component layouts. Three dimensional component layout tasks are typically highly combinatorial, and exhibit objective function spaces that can be nonlinear and/or discontinuous due to discrete allowable locations for component placement. We present an approach to the three dimensional component layout problem that employs shape annealing, a design generation technique combining concepts from shape grammars and simulated annealing, to produce optimally directed designs. The shape annealing paradigm sacrifices global optimality in exchange for the ability to find good designs in a reasonable amount of time, given very large, ill-behaved objective function spaces.
APA, Harvard, Vancouver, ISO, and other styles
7

Kothari, Anshul, Tuomas Sandholm, and Subhash Suri. "Solving combinatorial exchanges." In the 4th ACM conference. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/779928.779976.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Fujita, Kikuo, and Masayuki Kawamoto. "Hierarchical Optimization-Based Approach for Two-Dimensional Rectangular Layout Design Problems." In ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/detc2009-87410.

Full text
Abstract:
This paper proposes a hierarchical optimization-based approach for two-dimensional rectangular layout design problems. While decomposition-based optimization has been a key approach for the complicated design problems under the trend of multidisciplinary design optimization, it has focused on continuous ones. While various approaches for layout design have been developed, they are based on any evolutionary algorithm for effectively handling its combinatorial nature. This paper aims to bring a new paradigm by combining decomposition-based optimization and evolutionary algorithms toward solving complicated layout design problems. In the approach, the Pareto optimality of subsystem-level layout against the optimality of system-level layout is extracted through two-level hierarchical formulation. Then, a computational design algorithm is developed. It represents the layout topology with sequence-pair and the shape of each subsystem or component with the aspect ratio, and optimizes them with genetic algorithms. The Pareto optimality of sub-levels is handled with multi-objective genetic algorithms, in which a set of Pareto are simultaneously generated. Top-level and sub-level layout problems are coordinated through exchange of preferable ranges of shapes and layout. An implemented approach is applied to an example problem for demonstrating its performance and capability.
APA, Harvard, Vancouver, ISO, and other styles
9

Biswas, Shantanu, and Y. Narahari. "Approximately Efficient Iterative Mechanisms for Combinatorial Exchanges." In 2009 IEEE Conference on Commerce and Enterprise Computing (CEC). IEEE, 2009. http://dx.doi.org/10.1109/cec.2009.61.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Biswas, Shantanu, and Y. Narahari. "Tâtonnement Mechanisms for Combinatorial Exchanges." In 2010 IEEE 12th Conference on Commerce and Enterprise Computing (CEC). IEEE, 2010. http://dx.doi.org/10.1109/cec.2010.24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Combinatorial exchange' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography