919 resultados para Style branch


Relevância:

20.00% 20.00%

Publicador:

Resumo:

http://digitalcommons.fiu.edu/fce_lter_photos/1297/thumbnail.jpg

Relevância:

20.00% 20.00%

Publicador:

Resumo:

http://digitalcommons.fiu.edu/fce_lter_photos/1296/thumbnail.jpg

Relevância:

20.00% 20.00%

Publicador:

Resumo:

http://digitalcommons.fiu.edu/fce_lter_photos/1279/thumbnail.jpg

Relevância:

20.00% 20.00%

Publicador:

Resumo:

http://digitalcommons.fiu.edu/fce_lter_photos/1278/thumbnail.jpg

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Supply chain operations directly affect service levels. Decision on amendment of facilities is generally decided based on overall cost, leaving out the efficiency of each unit. Decomposing the supply chain superstructure, efficiency analysis of the facilities (warehouses or distribution centers) that serve customers can be easily implemented. With the proposed algorithm, the selection of a facility is based on service level maximization and not just cost minimization as this analysis filters all the feasible solutions utilizing Data Envelopment Analysis (DEA) technique. Through multiple iterations, solutions are filtered via DEA and only the efficient ones are selected leading to cost minimization. In this work, the problem of optimal supply chain networks design is addressed based on a DEA based algorithm. A Branch and Efficiency (B&E) algorithm is deployed for the solution of this problem. Based on this DEA approach, each solution (potentially installed warehouse, plant etc) is treated as a Decision Making Unit, thus is characterized by inputs and outputs. The algorithm through additional constraints named “efficiency cuts”, selects only efficient solutions providing better objective function values. The applicability of the proposed algorithm is demonstrated through illustrative examples.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Historically, the concepts of field-independence, closure flexibility, and weak central coherence have been used to denote a locally, rather globally, dominated perceptual style. To date, there has been little attempt to clarify the relationship between these constructs, or to examine the convergent validity of the various tasks purported to measure them. To address this, we administered 14 tasks that have been used to study visual perceptual styles to a group of 90 neuro-typical adults. The data were subjected to exploratory factor analysis. We found evidence for the existence of a narrowly defined weak central coherence (field-independence) factor that received loadings from only a few of the tasks used to operationalise this concept. This factor can most aptly be described as representing the ability to dis-embed a simple stimulus from a more complex array. The results suggest that future studies of perceptual styles should include tasks whose theoretical validity is empirically verified, as such validity cannot be established merely on the basis of a priori task analysis. Moreover, the use of multiple indices is required to capture the latent dimensions of perceptual styles reliably.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

De nombreux problèmes liés aux domaines du transport, des télécommunications et de la logistique peuvent être modélisés comme des problèmes de conception de réseaux. Le problème classique consiste à transporter un flot (données, personnes, produits, etc.) sur un réseau sous un certain nombre de contraintes dans le but de satisfaire la demande, tout en minimisant les coûts. Dans ce mémoire, on se propose d'étudier le problème de conception de réseaux avec coûts fixes, capacités et un seul produit, qu'on transforme en un problème équivalent à plusieurs produits de façon à améliorer la valeur de la borne inférieure provenant de la relaxation continue du modèle. La méthode que nous présentons pour la résolution de ce problème est une méthode exacte de branch-and-price-and-cut avec une condition d'arrêt, dans laquelle nous exploitons à la fois la méthode de génération de colonnes, la méthode de génération de coupes et l'algorithme de branch-and-bound. Ces méthodes figurent parmi les techniques les plus utilisées en programmation linéaire en nombres entiers. Nous testons notre méthode sur deux groupes d'instances de tailles différentes (gran-des et très grandes), et nous la comparons avec les résultats donnés par CPLEX, un des meilleurs logiciels permettant de résoudre des problèmes d'optimisation mathématique, ainsi qu’avec une méthode de branch-and-cut. Il s'est avéré que notre méthode est prometteuse et peut donner de bons résultats, en particulier pour les instances de très grandes tailles.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This material is based upon work supported by the National Science Foundation through the Florida Coastal Everglades Long-Term Ecological Research program under Cooperative Agreements #DBI-0620409 and #DEB-9910514. This image is made available for non-commercial or educational use only.