Titre (en)
Exploration
Accueil
Racine
Exploration
Accueil
Racine

Serveur d'exploration sur l'Université de Trèves - Exploration (Accueil)

Index « Titre (en) » - entrée « minimization »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
minimax < minimization < minimum  Facettes :

List of bibliographic references indexed by minimization

Number of relevant bibliographic references: 13.
Ident.Authors (with country if any)Title
002278 (1998) Anna Slobodova [États-Unis, Slovaquie] ; Christoph Meinel [Allemagne]Sample Method for Minimization of OBDDs
002753 (1996) Michael Nast [Allemagne]Subdivision of simplices relative to a cutting plane and finite concave minimization
002775 (1996) R. Horst [Allemagne] ; M. Nast [Allemagne]Linearly constrained global minimization of functions with concave minorants
002791 (1996) R. Horst [Allemagne] ; N. V. Thoai [Viêt Nam]Decomposition approach for the global minimization of biconcave functions over polytopes
002A95 (1994) Nguyen V. Thoai [Allemagne]On the construction of test problems for concave minimization algorithms
002D66 (1992) R. Horst [Allemagne] ; N. V. Thoai [Viêt Nam]Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
002E90 (1991) Hoang Tuy [Viêt Nam]Normal conical algorithm for concave minimization over polytopes
002F02 (1991) Reiner Horst [Allemagne] ; Nguyen V. Thoai [Viêt Nam] ; Harold P. Benson [États-Unis]Concave minimization via conical partitions and polyhedral outer approximation
002F23 (1991) R. Horst [Allemagne] ; N. V. Thoai ; H. P. BensonConcave minimization via conical partitions and polyhedral outer approximation
003083 (1989) R. Horst [Allemagne] ; N. V. Thoai [Viêt Nam]Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
003158 (1988) R. Horst [Allemagne]Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization
003159 (1988) Hoang Tuy [Viêt Nam] ; Reiner Horst [Allemagne]Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems
003323 (1986) R. Horst [Allemagne]A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i -k "minimization" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i  \
                -Sk "minimization" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    Title.i
   |clé=    minimization
}}
Wicri

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024