brain < branch < branches

Facettes :

List of bibliographic references

Number of relevant bibliographic references: 22.
[0-20] [0 - 20][0 - 22][20-21][20-40]

Ident.	Authors (with country if any)	Title
000402 (1989)	R. Horst [Allemagne]	On consistency of bounding operations in deterministic global optimization
000591 (1988)	R. Horst [Allemagne] ; Ng V. Thoai [Viêt Nam]	Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
000870 (1996)	Reiner Horst [Allemagne] ; Nguyen Van Thoai [Allemagne]	A new algorithm for solving the general quadratic programming problem
000972 (2013)	Shixin Ma [États-Unis] ; Akiko Maehara [États-Unis] ; Karl E. Hauptmann [Allemagne] ; Giulio Guagliumi [Italie] ; Orazio Valsecchi [Italie] ; Angelina Vassileva [Italie] ; Yolande Appelman [Pays-Bas] ; Giuseppe Sangiorgi [Italie] ; Francesco Prati [Italie] ; Gary S. Mintz [États-Unis]	Intravascular ultrasound comparison of the self‐expanding sideguard stent in the side branch versus a balloon‐expandable stent in the main vessel to assess mechanisms of acute lumen gain in bifurcation lesions
000D24 (1990)	Harold P. Benson [États-Unis] ; S. Selcuk Erenguc [États-Unis] ; Reiner Horst [Allemagne]	A note on adapting methods for continuous global optimization to the discrete case
000E38 (1986)	R. Horst [Allemagne]	A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
000E62 (1996)	R. Horst [Allemagne] ; N. V. Thoai [Viêt Nam]	Decomposition approach for the global minimization of biconcave functions over polytopes
000E93 (1994)	R. Horst [Allemagne] ; L. D. Muu [Viêt Nam] ; M. Nast [Allemagne]	Branch-and-bound decomposition approach for solving quasiconvex-concave programs
000F04 (1991)	R. Horst [Allemagne] ; T. Q. Phong [Viêt Nam] ; Ng. V. Thoai [Viêt Nam] ; J. De Vries [Allemagne]	On solving a D.C. programming problem by a sequence of linear programs
000F30 (1991)	Reiner Horst [Allemagne] ; Nguyen V. Thoai [Viêt Nam] ; Harold P. Benson [États-Unis]	Concave minimization via conical partitions and polyhedral outer approximation
000F46 (1992)	R. Horst [Allemagne] ; N. V. Thoai [Allemagne] ; J. De Vries [Allemagne]	A new simplicial cover technique in constrained global optimization
001007 (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
001036 (1994)	Klaus Jansen [Allemagne]	On the complexity of allocation problems in high-level synthesis
001063 (1990)	Reiner Horst [Allemagne]	Deterministic methods in constrained global optimization: Some recent advances and new fields of application
001088 (1987)	R. Horst [Allemagne] ; H. Tuy [Viêt Nam]	On the convergence of global methods in multiextremal optimization
001100 (1999)	Reiner Horst [Allemagne] ; Nguyen V. Thoai [Allemagne]	Maximizing a concave function over the efficient or weakly-efficient set
001142 (1996)	Michael Nast [Allemagne]	Subdivision of simplices relative to a cutting plane and finite concave minimization
001278 (1995)	R. Horst [Allemagne] ; M. Nast [Allemagne] ; N. V. Thoai [Viêt Nam]	New LP bound in multivariate Lipschitz optimization: Theory and applications
001570 (1999)	Ralf Zahn [Allemagne] ; Rudolf Schiele [Allemagne] ; Karlheinz Seidl [Allemagne] ; Caroline Bergmeier [Allemagne] ; Karl K. Haase [Allemagne] ; Hans G. Glunz [Allemagne] ; Karl E. Hauptmann [Allemagne] ; Thomas Voigtl Nder [Allemagne] ; Martin Gottwik [Allemagne] ; Jochen Senges [Allemagne]	Primary percutaneous transluminal coronary angioplasty for Acute Myocardial Infarction in patients not included in randomized studies
001572 (1992)	Faiz A. Al-Khayyal [États-Unis] ; Reiner Horst [Allemagne] ; Panos M. Pardalos [États-Unis]	Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
001726 (2008)	Daniel Raible [Allemagne] ; Henning Fernau [Allemagne]	A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Curation

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Curation/AbsEn.i -k "branch" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Curation/AbsEn.i  \
                -Sk "branch" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd 

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

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Istex
   |étape=   Curation
   |type=    indexItem
   |index=    AbsEn.i
   |clé=    branch
}}

---

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