Volume 51, Number 1, September 2011

• 
  Jean B. Lasserre: Min-max and robust polynomial optimization. 1-10
• 
  O. A. Boikanyo, Gheorghe Morosanu: Inexact Halpern-type proximal point algorithm. 11-26
• 
  Rattanaporn Wangkeeree, Narin Petrot, Rabian Wangkeeree: The general iterative methods for nonexpansive mappings in Banach spaces. 27-46
• 
  Qipeng P. Zheng, Ashwin Arulselvan: Discrete time dynamic traffic assignment models and solution algorithm for managed lanes. 47-68
• 
  Yekini Shehu: Iterative approximation method for finite family of relatively quasi nonexpansive mappings and systems of equilibrium problems. 69-78
• 
  Juliane Müller, Robert Piché: Mixture surrogate models based on Dempster-Shafer theory for global optimization problems. 79-104
• 
  Jia Tang, Sanyang Liu, Changfeng Ma: A new C-function for symmetric cone complementarity problems. 105-113
• 
  Mark-Christoph Körner, Jack Brimberg, Henrik Juel, Anita Schöbel: Geometric fit of a point set by generalized circles. 115-132
• 
  Yi-Feng Hung, Wei-Chih Chen: A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm. 133-148
• 
  Eduardo Muñoz, Mathias Stolpe: Generalized Benders' Decomposition for topology optimization problems. 149-183

Volume 51, Number 2, October 2011

• 
  Jie Lu, Guangquan Zhang: Guest editorial: a special issue on optimization techniques for business intelligence systems. 185-187
• 
  Begoña Vitoriano, M. Teresa Ortuño, Gregorio Tirado, Javier Montero: A multi-criteria optimization model for humanitarian aid distribution. 189-208
• 
  Özgür Kabak, Da Ruan: A comparison study of fuzzy MADM methods in nuclear safeguards evaluation. 209-226
• 
  Xiaoguang Deng, Xianyi Zeng, Philippe Vroman, Ludovic Koehl: An intelligent multi-criteria optimization method for quick and market-oriented textile material design. 227-244
• 
  Ya Gao, Guangquan Zhang, Jie Lu, Hui-Ming Wee: Particle swarm optimization for bi-level pricing problems in supply chains. 245-254
• 
  Jun Liu, Luis Martínez, Da Ruan, Rosa M. Rodriguez, Alberto Calzada: Optimization algorithm for learning consistent belief rule-base from examples. 255-270
• 
  Xinghuo Yu, Bin Wang, Batsukh Batbayar, Liuping Wang, Zhihong Man: An improved training algorithm for feedforward neural network learning based on terminal attractors. 271-284
• 
  Muhammad Raza, Omar Khadeer Hussain, Farookh Khadeer Hussain, Elizabeth Chang: Maturity, distance and density (MD2) metrics for optimizing trust prediction for business intelligence. 285-300
• 
  José Maria Pangilinan, Gerrit K. Janssens: Pareto-optimality of oblique decision trees from evolutionary algorithms. 301-311
• 
  Qinghua Zhou, Yan Li, Minghu Ha: Constructing composite search directions with parameters in quadratic interpolation models. 313-324
• 
  Dun Liu, Tian-rui Li, Da Ruan, Junbo Zhang: Incremental learning optimization on knowledge discovery in dynamic business intelligent systems. 325-344
• 
  Constantin Udriste, Ionel Tevy: Multitime dynamic programming for multiple integral actions. 345-360
• 
  Constantin Udriste, Andreea Bejenaru: Riemannian convexity of functionals. 361-376

Volume 51, Number 3, November 2011

• 
  Hanif D. Sherali, Evrim Dalkiran: Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs. 377-393
• 
  Yi Jiang, Yiran He, Jie Sun: Subdifferential properties of the minimal time function of linear control systems. 395-412
• 
  Zijia Peng, Zhenhai Liu: Evolution hemivariational inequality problems with doubly nonlinear operators. 413-427
• 
  Sheng-Long Hu, Zheng-Hai Huang: Alternating direction method for bi-quadratic programming. 429-446
• 
  Maggie X. Cheng, Xuan Gong: Maximum lifetime coverage preserving scheduling algorithms in sensor networks. 447-462
• 
  Zhaoyang Duan, Lizhi Wang: Heuristic algorithms for the inverse mixed integer linear programming problem. 463-471
• 
  Bilian Chen, Changfeng Ma: A new smoothing Broyden-like method for solving nonlinear complementarity problem with a P 0-function. 473-495
• 
  Pablo San Segundo: New decision rules for exact search in N-Queens. 497-514
• 
  Weiqi Li: Seeking global edges for traveling salesman problem in multi-start search. 515-540
• 
  X. B. Li, S. J. Li: Continuity of approximate solution mappings for parametric equilibrium problems. 541-548
• 
  Z. Y. Wu, G. Q. Li, J. Quan: Global optimality conditions and optimization methods for quadratic integer programming problems. 549-568

Volume 51, Number 4, December 2011

• 
  Joseph K. Scott, Matthew D. Stuber, Paul I. Barton: Generalized McCormick relaxations. 569-606
• 
  Onay Urfalioglu, Orhan Arikan: Self-adaptive randomized and rank-based differential evolution for multimodal problems. 607-640
• 
  D. R. Sahu, Jen-Chih Yao: The prox-Tikhonov regularization method for the proximal point algorithm in Banach spaces. 641-655
• 
  Adela Capata: Existence results for proper efficient solutions of vector equilibrium problems and applications. 657-675
• 
  Thai Doan Chuong, Alexander Y. Kruger, J.-C. Yao: Calmness of efficient solution maps in parametric vector optimization. 677-688
• 
  Uthai Kamraksa, Rabian Wangkeeree: Generalized equilibrium problems and fixed point problems for nonexpansive semigroups in Hilbert spaces. 689-714
• 
  Ernesto G. Birgin, L. F. Bueno, Natasa Krejic, José Mario Martínez: Low order-value approach for solving VaR-constrained optimization problems. 715-742
• 
  Adriel Cheng, Cheng-Chew Lim: Markov modelling and parameterisation of genetic evolutionary test generations. 743-751

last updated on Mon May 20 03:24:31 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page