ALGORITHME GLOUTON PDF

This Note presents an approximation method for convex yield surfaces in the framework of yield design theory. The proposed algorithm constructs an approximation using a convex hull of ellipsoids such that the approximate criterion can be formulated in terms of second-order conic constraints. The algorithm can treat bounded as well as unbounded yield surfaces. Its efficiency is illustrated on two yield surfaces obtained using up-scaling procedures. Previous Article Editorial Board. Journal page Archives Contents list.

Author:Kekora Mujar
Country:Thailand
Language:English (Spanish)
Genre:Travel
Published (Last):15 October 2012
Pages:107
PDF File Size:19.74 Mb
ePub File Size:10.83 Mb
ISBN:951-2-55495-906-2
Downloads:31056
Price:Free* [*Free Regsitration Required]
Uploader:Yozshulkis



This Note presents an approximation method for convex yield surfaces in the framework of yield design theory. The proposed algorithm constructs an approximation using a convex hull of ellipsoids such that the approximate criterion can be formulated in terms of second-order conic constraints.

The algorithm can treat bounded as well as unbounded yield surfaces. Its efficiency is illustrated on two yield surfaces obtained using up-scaling procedures. Previous Article Editorial Board. Journal page Archives Contents list. Article Article Outline. Access to the text HTML. Access to the PDF text. Recommend this article. Save as favorites. Access to the full text of this article requires a subscription.

If you are a subscriber, please sign in 'My Account' at the top right of the screen. A greedy algorithm for yield surface approximation. Outline Masquer le plan. An interesting formulation using a convex hull of ellipsoids. Using the support function to characterize the local geometry. Computation of the best ellipsoid with prescribed curvature. Macroscopic yield surface of a stone column reinforced soil. Conclusions and future work. These values correspond, indeed, to normal vectors of supporting hyperplanes.

Top of the page - Article Outline. Contact Help Who are we? As per the Law relating to information storage and personal integrity, you have the right to oppose art 26 of that law , access art 34 of that law and rectify art 36 of that law your personal data. You may thus request that your data, should it be inaccurate, incomplete, unclear, outdated, not be used or stored, be corrected, clarified, updated or deleted. Personal information regarding our website's visitors, including their identity, is confidential.

The owners of this website hereby guarantee to respect the legal confidentiality conditions, applicable in France, and not to disclose this data to third parties. You can move this window by clicking on the headline. Yield surface approximation Numerical challenges. An algorithm to approximate a yield surface by a convex hull of ellipsoids General assumptions and notations.

Illustrative examples Interaction surface of a reinforced concrete beam section. Masquer le plan.

INTRODUCTION TO PARALLEL COMPUTING 2ND EDITION ANANTH GRAMA PDF

algorithme glouton sur un problème de graphe

We'd like to understand how you use our websites in order to improve them. Register your interest. After a short survey of the greedy algorithms, this article introduces two accelerated and accurate methods to solve the problems of the research of a subset maximizing a supermodular objective function: a first method leads to very good approximate solutions and gives lower and upper bounds in the meaning of inclusion of the optimal subset; a second enumerative method giving the exact solution uses as starting solutions, the ones given by the first method. This is a preview of subscription content, log in to check access. Rent this article via DeepDyve. Gondran M. Graphes et algorithmes.

DIEVISKOJI KOMEDIJA PDF

Théorème de Brooks

Newell algorithm. Watkins algorithm. To add entries to your own vocabulary , become a member of Reverso community or login if you are already a member. It's easy and only takes a few seconds:.

AU6990 PDF

Problème de couverture par ensembles

.

Related Articles