PascalFr.i
Checkpoint
PascalFrancis
Racine
Checkpoint
PascalFrancis
Exploration
Accueil
Racine
Racine

Serveur d'exploration sur l'Université de Trèves - Checkpoint (PascalFrancis)

Index « PascalFr.i » - entrée « Méthode branch and bound »
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.
Méthode aéroportée < Méthode branch and bound < Méthode calcul  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 11.
Ident.Authors (with country if any)Title
000F87 (1997) R. Horst [Allemagne] ; N. V. Thoai [Viêt Nam]Utility function programs and optimization over the efficient set in multiple-objective decision making
001202 (1996) R. Horst [Allemagne] ; M. NastLinearly constrained global minimization of functions with concave minorants
001223 (1996) R. Horst [Allemagne] ; N. V. ThoaiDecomposition approach for the global minimization of biconcave functions over polytopes
001281 (1995) R. Horst [Allemagne] ; M. Nast ; N. V. ThoaiNew LP bound in multivariate Lipschitz optimization: theory and applications
001347 (1994) R. Horst [Allemagne] ; L. D. Muu ; M. Nast [Allemagne]Branch-and-bound decomposition approach for solving quasiconvex-concave programs
001473 (1992) R. Horst [Allemagne] ; N. V. ThoaiConical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
001519 (1991) R. Horst [Allemagne] ; N. V. Thoai ; H. P. BensonConcave minimization via conical partitions and polyhedral outer approximation
001636 (1988) R. HorstDeterministic global optimization with partition sets whose feasibility is not known: application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization
001638 (1988) R. Horst ; N. V. ThoaiBranch-and-bound methods for solving systems of Lipschitzian equations and inequalities
001679 (1987) R. Horst ; H. TuyOn the convergence of global methods in multiextremal optimization
001720 (1986) R. HorstA 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/PascalFrancis/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/PascalFr.i -k "Méthode branch and bound" 

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/PascalFr.i  \
                -Sk "Méthode branch and bound" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd

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

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    indexItem
   |index=    PascalFr.i
   |clé=    Méthode branch and bound
}}
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