Academic literature on the topic 'Méthodes de relaxation (Mathématiques)'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Méthodes de relaxation (Mathématiques).'
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 "Méthodes de relaxation (Mathématiques)"
Chen, Yanguang. "Characteristic Scales, Scaling, and Geospatial Analysis." Cartographica: The International Journal for Geographic Information and Geovisualization 56, no. 2 (June 2021): 91–105. http://dx.doi.org/10.3138/cart-2020-0001.
Full textDimitradi, Leda. "Le Corbusier et la géométrie dans la pratique. Etude de deux exemples singuliers." LC. Revue de recherches sur Le Corbusier, no. 9 (March 27, 2024): 68–83. http://dx.doi.org/10.4995/lc.2024.19870.
Full textMarano, Francelyne. "Les méthodes alternatives à l’expérimentation animale, présent et futur." Biologie Aujourd’hui 217, no. 3-4 (2023): 199–205. http://dx.doi.org/10.1051/jbio/2023035.
Full textCoppé, Sylvie. "Évaluation et didactique des mathématiques : vers de nouvelles questions, de nouveaux travaux." Mesure et évaluation en éducation 41, no. 1 (January 31, 2019): 7–39. http://dx.doi.org/10.7202/1055895ar.
Full textMessier, Réjean L. "Les psychothérapies de relaxation ou est-ce que la relaxation a sa place en psychothérapie?" Santé mentale au Québec 3, no. 2 (June 2, 2006): 86–110. http://dx.doi.org/10.7202/030042ar.
Full textChigolet, Grégory. "Socialisme de marché ou planification mathématique ? Retour sur un débat aux ramifications contemporaines." Économie appliquée 63, no. 1 (2010): 165–76. http://dx.doi.org/10.3406/ecoap.2010.1939.
Full textBarallobres, Gustavo. "RÉFLEXIONS SUR LES LIENS ENTRE NEUROSCIENCES, MATHÉMATIQUES ET ÉDUCATION." Articles 53, no. 1 (February 19, 2019): 169–88. http://dx.doi.org/10.7202/1056288ar.
Full textGoffinet, B., J. Beckmann, D. Boichard, M. Causse, A. Charcosset, C. Chevalet, C. Christophe, et al. "Méthodes mathématiques pour l'étude des gènes contrôlant des caractères quantitatifs." Genetics Selection Evolution 26, Suppl 1 (1994): S9. http://dx.doi.org/10.1186/1297-9686-26-s1-s9.
Full textLounaci, Hakim, Ahmed Mellal, Samia Abid, and Amina Bendahmane. "Application des méthodes et outils d'aide à la décision dans l’analyse économique : cas de l’Algérie." les cahiers du cread 39, no. 3 (February 10, 2024): 5–26. http://dx.doi.org/10.4314/cread.v39i3.1.
Full textLebaron, Frédéric. "Un parcours d’enseignant en « quanti »." Revista Linhas 21, no. 45 (May 4, 2020): 285–92. http://dx.doi.org/10.5965/1984723821452020285.
Full textDissertations / Theses on the topic "Méthodes de relaxation (Mathématiques)"
Liess, Olivier. "Méthodes de décomposition non standard et applications." Avignon, 2006. http://www.theses.fr/2006AVIG0145.
Full textNeto, José. "Développement d'algorithmes de génération de contraintes et extensions." Evry, Institut national des télécommunications, 2006. http://www.theses.fr/2006TELE0003.
Full textSince they first appeared in the 50's, contraint generation algorithms are now commonly used when solving hard problems through a linear programming approach. In these algorithms, a relaxation of the formulation containing only a subset of the constraints is first solved. Then a separation procedure is called which adds to the relaxation any inequality of the formulation that is violated by the current solution. The process is iterated until no violated inequality can be found. We propose a modification of this resolution scheme at the level of the separation point used in order to improve performance. More precisely, we introduce two approaches. The first one, entitled In/Out, consists in defining the separation point as a convex combination of an optimal solution for the current relaxation, and of a feasible solution. Numerical experiments have been carried out on different problem types : randomly generated linear programs, survivability network design and multicommodity min-cost flow problems, namely. They show evidence of a potential strong improvement of performances with this kind of procedures. Another developed approach consists in using several points in the separation phase. We study the complexity of this kind of separation generalizing classical procedures, and of some other related problems. Namely we establish polynomial equivalence between a classical single-point separation and the multiple-points separation proposed. Preliminary computational experiments for this kind of separation illustrate efficiency of this approach. Both introduced methods : In/Out and multiple-points essentially differ from classical constraint generation procedures at the level of the point being used for separation. Another way to improve traditional schemes would consist in modifying the separation oracle so as to favour the generation of some particular inequalities. In this thesis we give a general characterization of relaxations with the same set of optimal solution as the one for the original problem, thus leading to an evaluation of the “relevance” of constraints present in the formulation used to get an optimal solution. Finally we report investigations on the maximum cut problem, at two levels. First we establish polynomiality of the separation problem for generalizations of two families of inequalities for some fixed parameter values : the so-called suspended-tree and path-block-cycle inequalities. Then, we introduce and evaluate an original rouding procedure applied to a particular formulation of the problem through a divide-and-conquer approach
Touati, Nora. "Amélioration des performances du schéma de la génération de colonnes : application aux problèmes de tournées de véhicules." Paris 13, 2008. http://www.theses.fr/2008PA132032.
Full textColumgeneration algorithms are instrumental in many areas of applied optimization where linear programs with an enormous number of variables need to be solued. Although success fully used in many applications, this method suffers from well-known "instability" issues, that somewhat limit its efficiency. This work focuses on accelerating strategies in a column generation algorithm. We propose some diversifiication methods in order to decrease the total number of generated columns and then master problems resolution time. We interest also to solving efficiently the pricing problems, by proposing an improning approch based on reoptimization principle and a new variant of the dynamic programming algorithm. The effectiveness of these approches is validated on vehicule routing problem with time windows
Fei, Hongying. "Vers un outil d'aide à la planification et à l'ordonnancement des blocs opératoires." Troyes, 2006. http://www.theses.fr/2006TROY0004.
Full textThis thesis presents our studies on the operating theatre management, especially on the operating theatre planning and scheduling problem in case that this surgical sector is always regarded as the kernel in a hospital in terms of the expenditure. Therefore, it’s necessary to optimize the assignment of hospital resources in the operating theatre. Since this type of problem is extremely complex, we concentrate on just two sub-problems that are also considered difficult ones by researchers: the surgical cases planning and scheduling problem, which aim to made a surgical cases programming with an objective of obtaining a realizable and efficient surgical cases operating schedule. At firth the weekly planning problems of surgical cases are formulated as a mathematical integer programming, and then they are solved by heuristic procedures and Branch-and-Price ones. All these procedures are based on the column generation procedure, which is used to solve the linear relaxation of each model for a lower bound. The scheduling models are treated as variants of hybrid two-stage flow shop problem and are solved by proposed hybrid genetic algorithms. Finally, our models are tested and validated in a real case
Loiseau, Irène. "Sur la génération de colonnes en nombres entiers." Paris 13, 2005. http://www.theses.fr/2005PA132018.
Full textWorrakitpoonpon, Tirawut. "Relaxation of isolated self-gravitating systems in one and three dimensions." Paris 6, 2011. http://www.theses.fr/2011PA066190.
Full textLargeron, Christine. "Reconnaissance de formes par relaxation : un modèle d'aide à la décision." Lyon 1, 1990. http://www.theses.fr/1990LYO10256.
Full textEttaouil, Mohamed. "Satisfaction de contraintes non linéaires en variables 0-1 et outils de la programmation quadratique." Paris 13, 1994. http://www.theses.fr/1994PA132006.
Full textBordes, Laurent. "Inférence statistique pour des modèles paramétriques et semi-paramétriques : modèles de l'exponentielle multiple, test du Chi-deux, modèles de vie accélérée." Bordeaux 1, 1996. http://www.theses.fr/1996BOR10649.
Full textMartin, Véronique. "Méthodes de décomposition de domaine de type relaxation d'ondes pour des équations de l'océanographie." Phd thesis, Université Paris-Nord - Paris XIII, 2003. http://tel.archives-ouvertes.fr/tel-00583196.
Full textBooks on the topic "Méthodes de relaxation (Mathématiques)"
Nizard, A. F. Méthodes mathématiques et programmation. Toulouse: Langage et informatique, 1988.
Find full textJean-Charles, Rochet, ed. Méthodes mathématiques de la finance. 3rd ed. Paris: Economica, 2005.
Find full textMonier, Jean-Marie. Mathématiques: Méthodes et exercices MP. Paris: Dunod, 2009.
Find full textRisler, Jean-Jacques. Méthodes mathématiques pour la CAO. Paris: Masson, 1991.
Find full textMonier, Jean-Marie. Mathématiques: Méthodes et exercices : PCSI-PTSI. Paris: Dunod, 2011.
Find full textCancès, Eric, Claude Le Bris, and Yvon Maday. Méthodes mathématiques en chimie quantique Une introduction. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/3-540-37661-5.
Full textMonier, Jean-Marie. Les méthodes et exercices de mathématiques MPSI. Paris: Dunod, 2008.
Find full textGassner, Marjorie. Représentations parlementaires: Méthodes mathématiques biproportionelles de répartition des sièges. Bruxelles (Belgique): Éditions de l'Université de Bruxelles, 2000.
Find full textMathématiques instrumentales et projets d'enfants. Mont-Royal, Qué: Éditions Modulo, 1992.
Find full textJoubert, Pierre. Circuits électriques et systèmes: Méthodes modernes de calcul. Paris: Lavoisier, 1986.
Find full textBook chapters on the topic "Méthodes de relaxation (Mathématiques)"
Del Moral, Pierre, and Christelle Vergé. "Méthodes MCMC en interaction." In Mathématiques et Applications, 263–85. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54616-7_9.
Full textCottet, Georges-Henri, Emmanuel Maitre, and Thomas Milcent. "Méthodes Level Set et interfaces lagrangiennes." In Mathématiques et Applications, 1–35. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-70075-1_1.
Full textDel Moral, Pierre, and Christelle Vergé. "Méthodes d’exploration locale et Schémas de Température." In Mathématiques et Applications, 193–218. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54616-7_7.
Full textDel Moral, Pierre, and Christelle Vergé. "Mesures de Feynman-Kac et Méthodes Particulaires." In Mathématiques et Applications, 219–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54616-7_8.
Full textDel Moral, Pierre, and Christelle Vergé. "Méthodes de Monte Carlo par Chaînes de Markov (MCMC)." In Mathématiques et Applications, 147–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54616-7_6.
Full textGuyomard, Marc. "Mathématiques pour la spécification et les structures de données." In Structures de données et méthodes formelles, 15–57. Paris: Springer Paris, 2011. http://dx.doi.org/10.1007/978-2-8178-0200-8_1.
Full textGodard, Roger, John de Boer, and Mark Lewis. "Les équations différentielles ordinaires « raides » et les méthodes robustes : une approche historique." In Annals of the Canadian Society for History and Philosophy of Mathematics/ Société canadienne d’histoire et de philosophie des mathématiques, 235–49. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-21494-3_14.
Full text"Mathématiques." In Analyse causale et méthodes quantitatives, 287–300. Les Presses de l’Université de Montréal, 2021. http://dx.doi.org/10.1515/9782760643222-020.
Full text"7 Méthodes numériques." In Mathématiques des marchés financiers, 125–48. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-0866-3-009.
Full text"7 Méthodes numériques." In Mathématiques des marchés financiers, 125–48. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-0866-3.c009.
Full text