51,459 Hits in 3.8 sec

Page 4646 of Mathematical Reviews Vol. , Issue 87h [page]

1987 Mathematical Reviews  
The first volume is entirely dedicated to the introduction of what constitutes the fundamental tools of combinatorial optimization in the view of the author.  ...  ISBN 2-7056-5976-5 These two volumes constitute an excellent “vue d’ensemble” of the basic concepts and the most important tools and models of combinatorial optimization.  ... 

Front Matter, Table of Contents, Preface, Program Committees, External Reviewers, List of Authors

Klaus Jansen, Claire Mathieu, José D. P. Rolim, Chris Umans, Marc Herbstritt
2016 International Workshop on Approximation Algorithms for Combinatorial Optimization  
LIPIcs volumes are published according to the principle of Open Access, i.e., they are available online and free of charge.  ...  LIPIcs is a series of high-quality conference proceedings across all fields in informatics.  ...  We gratefully acknowledge the Institute of Computer Science of the Christian-Albrechts-Universität zu Kiel, the Computer Science Department of École normale Supérieure, the Department of Computer Science  ... 
doi:10.4230/lipics.approx-random.2016.0 dblp:conf/approx/X16 fatcat:5aka2x4msbawlcwc55jleb3htm

Page 3442 of Mathematical Reviews Vol. , Issue 84h [page]

1984 Mathematical Reviews  
In Section 7 Lagrangian relaxation is discussed. Polyhedral combinatorics and cutting plane methods for combinatorial optimization problems are described in Section 8.”  ...  The reader is assumed to be familiar with graph theory, linear algebra, some combinatorial optimization and linear programming Sekiguchi, Yasuki 84h:90087 A unifying framework of combinatorial optimization  ... 

Page 1573 of Mathematical Reviews Vol. , Issue 2004b [page]

2004 Mathematical Reviews  
The three-volume set under review summarizes the state of the art of the polyhedral approach to combinatorial optimization.  ...  By now, the polyhedral method constitutes a standard tool both in theory and in practice of combinatorial optimization.  ... 

An Agent Based Market Design Methodology for Combinatorial Auctions

Jinho Choi, Gyoo Gun Lim, Kun Chang Lee
2010 Journal of Artificial Societies and Social Simulation  
Then we illustrate a design process for the general n-bilateral combinatorial auction market. This study serves as a guideline for practical implementation of combinatorial auction markets design.  ...  Winner determination design is about determining the decision model for selecting optimal bids and auctioneers. Optimization models are identified by Forward Chain Reasoning.  ...  Acknowledgements This research was supported by WCU(World Class University) program through the National Research Foundation of Korea funded by the Ministry of Education, Science and Technology (Grant  ... 
doi:10.18564/jasss.1557 fatcat:52gxvrkb5fdyjkwqq2wg67z5iu

Library design in combinatorial chemistry by Monte Carlo methods

Marco Falcioni, Michael W. Deem
2000 Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics  
Strategies for searching the space of variables in combinatorial chemistry experiments are presented, and a random energy model of combinatorial chemistry experiments is introduced.  ...  The search strategies, derived by analogy with the computer modeling technique of Monte Carlo, effectively search the variable space even in combinatorial chemistry experiments of modest size.  ...  THE RANDOM PHASE VOLUME MODEL The effectiveness of these protocols is demonstrated by combinatorial chemistry experiments as simulated by the Random Phase Volume Model.  ... 
doi:10.1103/physreve.61.5948 pmid:11031658 fatcat:4fnindtpareitlqsqfquf3h644

Page 1070 of Mathematical Reviews Vol. 56, Issue 3 [page]

1978 Mathematical Reviews  
Lawler, Some aspects of duality in combinatorial optimization (pp. 109-116); J. P. Barthés, Branching methods in combinatorial optimization (pp. 117-143); A. Martelli and U.  ...  Rinaldi, Optimal unconstrained cycles in graphs (pp. 7-45); S. Rinaldi, Optimal constrained cycles in graphs (pp. 47-67); F.  ... 

The Optimization Analysis of Moments in the Combinatorial Model System

1989 Drug Metabolism and Pharmacokinetics  
)2 (7) [Here pi and qi are the partitions of unity which correspond to the partitions of CLint and V to Ci respectively for i=1 and 2.] 2) Especially if r =r2, then (7) CLi t=0, then MRT(C1#...  ...  Let the total sum of intrinsic clearances in the system be constant (=CL i nt), and the inlet blood flow and the total sum of volumes in the system be also constant (=Q and V respectively), then we obtained  ... 
doi:10.2133/dmpk.4.376 fatcat:qbelxf2jdngazo5p4nomn2b5f4

Combined Partitioning Hardware-Software Algorithms

Mehdi Jemai, Sonia Dimassi, Bouraoui Ouni, Abdellatif Mtibaa
2015 International Journal of Computer Applications  
In fact, meta-heuristics can produce acceptable solutions within a reasonable time, but they do not guarantee an optimal solution.  ...  In recent years, meta-heuristics have become increasingly interesting in solving combinatorial problems including hardware-software partitioning.  ...  RIBEIRO Fig. 1 : 1 The main methods of resolution Fig. 2 : 2 Main procedures of the proposed algorithms International Journal of Computer Applications (0975 -8887) Volume 119 -No.4, June 2015 Fig  ... 
doi:10.5120/21054-3701 fatcat:fe5ju7l2hfhk7huvtc3jqkvmee

Page 3030 of Mathematical Reviews Vol. , Issue 83h [page]

1983 Mathematical Reviews  
Some properties of functions defined in combinatorial space and their use in solving optimization problems; 6. The decomposition method; 7. Construction and study of packets of applied programs; 8.  ...  components; 7. Finiteness of an algorithm and its basis; 8.  ... 

Using error-correcting dependencies for collaborative filtering

Galina Bogdanova, Tsvetanka Georgieva
2008 Data & Knowledge Engineering  
Journal of Combinatorial Theory.Series A, 113(8), 1719-173 7. Ding, C., Yin, J. A construction of optimal constant composition codes Quistorff, J.  ...  Journal of Combinatorial Theory.Series A, 113(8), 1719-1731. 52. Smith, D. H., Hughes, L. A., & Perkins, S. (2006). A new table of constant weight codes of length greater than 28.  ... 
doi:10.1016/j.datak.2008.04.008 fatcat:xkgdz76effgp3lsjzeftlebspy

A Multi-task Combinatorial Optimization Model Based on Genetic Algorithm and its Application in College Education Curriculum Planning

Jianying Li, Zhe Zhou, Liying Wang
2015 International Journal of Emerging Technologies in Learning (iJET)  
Multi-task combinatorial optimization of a complex system is an important aspect of multi-task planning.  ...  The result indicates that the multi-task combinatorial optimization model based on genetic algorithm can relatively significantly optimize curriculum planning of higher education.  ...  To address problems in multi-task combinatorial optimization in complex systems, the paper proposes a multitask combinatorial optimization model based on GA.  ... 
doi:10.3991/ijet.v10i8.5218 fatcat:lzre6czubfhs5og5bbbgik3fha

Page 1981 of Mathematical Reviews Vol. , Issue 81I [page]

1981 Mathematical Reviews  
Bose, Combinatorial problems of experimental design, II. Factorial de- signs (pp. 7-18); Peter J. Cameron and David A.  ...  Combinatorial mathematics, optimal designs and their applications.  ... 

New Trends in Synthetic Medicinal Chemistry. (Methods and Principles in Medicinal Chemistry, Volume 7)

Shu-Kun Lin
2001 Molecules  
The most modern synthetic developments of pharmacologically interesting compounds (carbohydrates and nucleotides) as well as important synthetic methods such as combinatorial chemistry, solid-phase reactions  ...  Written by an internationally renowned team of authors and editors from academia and industry, this volume describes all recent developments in organic synthetic methodology which are essential for pharmaceutical  ...  Designs 23 2.2.5 Cluster Designs 25 2.3 Optimization 26 2.3.1 The CARSO Procedure 26 2.4 Disjoint Principal Properties 27 2.5 Combinatorial Chemistry 28 2.6 Examples 30 2.6.1 Applications of design  ... 
doi:10.3390/61201022 fatcat:tdtkgg3kejg77al2fe4gueoeiu

An algorithm for optimal difference systems of sets

Vladimir D. Tonchev, Hao Wang
2007 Journal of combinatorial optimization  
Tonchev Steiner systems for two-stage disjunctive testing, Journal of Combinatorial Optimization, 15 (2008), 1-6. 4. C. Sarami and V.D.  ...  Tonchev, Difference systems of sets and cyclotomy, Discrete Math. 308 (2008), 2959-2969. 2007 7. V.D. Tonchev, A class of 2-(3 n 7, 3 n−1 7, (3 n−1 7 − 1)/2) designs, J.  ...  Tonchev, A formula for the number of Steiner quadruple systems on 2 n points of 2-rank 2 n − n, Journal of Combinatorial Designs, 11 (2003), 260-274. 25. M. Harada and V.D.  ... 
doi:10.1007/s10878-007-9064-6 fatcat:zgfx2dhb6rabhkpjcfe3vbummy
« Previous Showing results 1 — 15 out of 51,459 results