default search action
Optimization Letters, Volume 2
Volume 2, Number 1, January 2008
- Marco Gaviano, Daniela Lera:
A global minimization algorithm for Lipschitz functions. 1-13 - V. Jeyakumar
:
A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions. 15-25 - Chung-Yee Lee, Gang Yu:
Parallel-machine scheduling under potential disruption. 27-37 - Wikrom Jaruphongsa, Chung-Yee Lee:
Dynamic lot-sizing problem with demand time windows and container-based transportation cost. 39-51 - Clayton W. Commander
Jamming communication networks under complete uncertainty. 53-70 - Antonino Maugeri, Fabio Raciti
On general infinite dimensional complementarity problems. 71-90 - Shashi Kant Mishra
On non-smooth alpha-invex functions and vector variational-like inequality. 91-98 - Mohammad Al Hasan, Krishna K. Ramachandran, John E. Mitchell:
Optimal placement of stereo sensors. 99-111 - Maria Bernadette Donato
Dynamic Walrasian price equilibrium problem: evolutionary variational approach with sensitivity analysis. 113-126 - Qiang Qiang, Anna Nagurney:
A unified network performance measure with importance identification and the ranking of network components. 127-142
Volume 2, Number 2, March 2008
- Sjur Didrik Flåm, Hubertus Th. Jongen, Oliver Stein:
Slopes of shadow prices and Lagrange multipliers. 143-155 - Kyriaki Kosmidou
Generating interest rate scenarios for bank asset liability management. 157-169 - Michael J. Laszlo, Sumitra Mukherjee:
An approximation algorithm for network design problems with downwards-monotone demand functions. 171-175 - Francesca Mariani
Maximum likelihood estimation of the Heston stochastic volatility model using asset and option prices: an application of nonlinear filtering theory. 177-222 - Vaithilingam Jeyakumar
Global minimization of difference of quadratic and convex functions over box or binary constraints. 223-238 - Jinghao Zhu, Xi Zhang:
On global optimizations with polynomials. 239-249 - Massimiliano Caramia
An exact approach for the maximum concurrent k -splittable flow problem. 251-265 - Nuno P. Faísca, Konstantinos I. Kouramas, Pedro M. Saraiva
A multi-parametric programming approach for constrained dynamic programming problems. 267-280 - Guang-Zhen Sun:
An economic approach to some classical theorems in optimization theory. 281-286
Volume 2, Number 3, June 2008
- Alexander J. Zaslavski:
Exact penalty property for a class of inequality-constrained minimization problems. 287-298 - Magdalene Marinaki, Yannis Marinakis, Michael Doumpos, Nikolaos F. Matsatsinis, Constantin Zopounidis:
A comparison of several nearest neighbor classifier metrics using Tabu Search algorithm for the feature selection problem. 299-308 - Boban Marinkovic
Optimality conditions for discrete calculus of variations problems. 309-318 - Di Wu, Zhijun Wu, Yaxiang Yuan:
Rigid versus unique determination of protein structures with geometric buildup. 319-331 - Han-Lin Li, Jung-Fa Tsai, Christodoulos A. Floudas:
Convex underestimation for posynomial functions of positive variables. 333-340 - Shengjie Li, Jing Zeng:
Existences of solutions for generalized vector quasi-equilibrium problems. 341-349 - Yannis Marinakis, Athanasios Migdalas, Panos M. Pardalos:
Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem. 351-361 - Fabio Tardella:
Existence and sum decomposition of vertex polyhedral convex envelopes. 363-375 - Werner Römisch, Stefan Vigerske:
Quantitative stability of fully random mixed-integer two-stage stochastic programs. 377-388 - Yuriy Zinchenko:
On hyperbolicity cones associated with elementary symmetric polynomials. 389-402 - Eissa Nematollahi, Tamás Terlaky
A simpler and tighter redundant Klee-Minty construction. 403-414 - Harald Günzel, Hubertus Th. Jongen, Oliver Stein:
Generalized semi-infinite programming: the Symmetric Reduction Ansatz. 415-424 - Hong-Bin Chen, Hung-Lin Fu, Frank K. Hwang:
An upper bound of the number of tests in pooling designs for the error-tolerant complex model. 425-431 - Bo Yuan
Extending a class of continuous estimation of distribution algorithms to dynamic problems. 433-443
Volume 2, Number 4, August 2008
- Tibor Csendes, László Pál, José-Oscar H. Sendín, Julio R. Banga
The GLOBAL optimization method revisited. 445-454 - Thomas C. Sharkey
Simplex-inspired algorithms for solving a class of convex programming problems. 455-481 - Charles Audet, Pierre Hansen, Alejandro Karam, Chi To Ng
Exact L 2-norm plane separation. 483-495 - Tamás Terlaky
Comments on "Dual methods for nonconvex spectrum optimization of multicarrier systems". 497-503 - René Meziat, Diego Patiño
Exact relaxations of non-convex variational problems. 505-519 - Giampaolo Liuzzi
A derivative-free algorithm for systems of nonlinear inequalities. 521-534 - Malay Bhattacharyya
On single courier problem. 535-541 - Elisabetta Allevi
An extended Gauss-Seidel method for a class of multi-valued complementarity problems. 543-553 - M. P. Mulaudzi, Mark Adam Petersen, I. M. Schoeman:
Optimal allocation between bank loans and treasuries with regret. 555-566 - George Isac, Sándor Zoltán Németh
Regular exceptional family of elements with respect to isotone projection cones in Hilbert spaces and complementarity problems. 567-576 - Maria Flavia Monaco
Some observations about the extreme points of the Generalized Cardinality-Constrained Shortest Path Problem polytope. 577-585 - Roy H. Kwon, Georgios V. Dalakouras, Cheng Wang:
On a posterior evaluation of a simple greedy method for set packing. 587-597 - Z. Husain, Izhar Ahmad
Note on Mond-Weir type nondifferentiable second order symmetric duality. 599-604 - D. G. Bakogianni, Konstantinos A. Lazopoulos:
Stability of strain gradient elastic bars in tension. 605-606
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-02 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: