Branch and bound algorithms < Branch and bound method < Branching

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
000365 (2010)	N. V. Thoai [Allemagne]	Reverse Convex Programming Approach in the Space of Extreme Criteria for Optimization over Efficient Sets
000427 (2010)	R. Horst [Allemagne]	Bisecton by Global Optimization Revisited
000835 (2005)	N. V. Thoai [Allemagne] ; Y. Yamamoto [Japon] ; A. Yoshise [Japon]	Global optimization method for solving mathematical programs with linear complementarity constraints
000A82 (2002)	Marco Locatelli [Italie] ; Ulrich Raber [Allemagne]	Packing equal circles in a square: a deterministic global optimization approach
000B15 (2002)	N. V. Thoai [Allemagne]	Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
000C75 (2000)	M. Locatelli [Italie] ; U. Raber [Allemagne]	On convergence of the simplicial branch-and-bound algorithm based on ω-subdivisions
000C98 (2000)	M. Locatelli [Italie] ; U. Raber [Allemagne]	Finiteness result for the simplicial branch-and-bound algorithm based on ω-subdivisions
000D04 (2000)	N. V. Thoai [Allemagne]	Duality bound method for the general quadratic programming problem with quadratic constraints
000D80 (1999)	R. Horst [Allemagne] ; N. V. Thoai [Allemagne]	Maximizing a concave function over the efficient or weakly-efficient set
000E02 (1999)	R. Horst [Allemagne] ; N. V. Thoai [Allemagne]	DC programming : Overview
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
001042 (1997)	M. Dür [Allemagne] ; R. Horst [Allemagne]	Lagrange duality and partitioning techniques in nonconvex global optimization
001202 (1996)	R. Horst [Allemagne] ; M. Nast	Linearly constrained global minimization of functions with concave minorants
001223 (1996)	R. Horst [Allemagne] ; N. V. Thoai	Decomposition approach for the global minimization of biconcave functions over polytopes
001281 (1995)	R. Horst [Allemagne] ; M. Nast ; N. V. Thoai	New 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. Thoai	Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
001519 (1991)	R. Horst [Allemagne] ; N. V. Thoai ; H. P. Benson	Concave minimization via conical partitions and polyhedral outer approximation
001636 (1988)	R. Horst	Deterministic 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. Thoai	Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
001679 (1987)	R. Horst ; H. Tuy	On the convergence of global methods in multiextremal optimization

---

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/KwdEn.i -k "Branch and bound method" 

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/KwdEn.i  \
                -Sk "Branch and bound method" \
         | 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=    KwdEn.i
   |clé=    Branch and bound method
}}

---

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