An adapted branch and bound algorithm for approximating real root of a ploynomial. (English)
Le Thi, Hoai An (ed.) et al., Modelling, computation and optimization in information systems and management sciences. Second international conference MCO 2008, Metz, France - Luxembourg, September 8‒10, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87476-8/pbk). Communications in Computer and Information Science 14, 182-189 (2008).
1
Convex analysis based smooth approximations of maximum functions and squared-distance functions. (English)
J. Nonlinear Convex Anal. 9, No. 3, 379-406 (2008).
2
Implementation of a variance reduction-based lower bound in a branch-and-bound algorithm for the quadratic assignment problem. (English)
SIAM J. Optim. 7, No.1, 280-294 (1997).
3
Domination \& separation applied to the quadratic assignment problem. (English)
Pardalos, Panos M. (ed.) et al., Quadratic assignment and related problems. DIMACS Workshop, May 20-21, 1993, Rutgers Univ., New Brunswick, NJ, USA. Providence, RI: AMS. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 16, 189-197 (1994).
4
Integer solution on the concave quadratic programs through simple branching. (English)
Pure Appl. Math. Sci. 28, No.1-2, 43-49 (1988).
5
A branch and search algorithm for a class of nonlinear knapsack problems. (English)
Oper. Res. Lett. 2, 155-160 (1983).
6
Minimum-weight design of a rotating cantilever beam with specified flapping frequency. (English)
Optimization of distributed parameter structures, Vol. II, NATO Adv. Study Inst. Ser., E, Appl. Sci. 50, 875-896 (1981).
7
Algorithms for optimal allocation problems having quadratic objective function. (English)
J. Oper. Res. Soc. Japan 23, 64-80 (1980).
8
Start
Contact
Print
General Help
