Optimization Letters, Volume 4

Volume 4, Number 1, January 2010

• Jean B. Lasserre:
  On representations of the feasible set in convex optimization. 1-5
  
• Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger:
  The approximability of three-dimensional assignment problems with bottleneck objective. 7-16
  
• X. B. Li, S. J. Li:
  Existence of solutions for generalized vector quasi-equilibrium problems. 17-28
  
• Ilias S. Kotsireas, Christos Koukouvinos, Panos M. Pardalos:
  An efficient string sorting algorithm for weighing matrices of small weight. 29-36
  
• Massimiliano Caramia, Antonino Sgalambro:
  A fast heuristic algorithm for the maximum concurrent k-splittable flow problem. 37-55
  
• C. S. Lalitha:
  A note on duality of generalized equilibrium problem. 57-66
  
• Yusif S. Gasimov, Abdeljalil Nachaoui, Agaddin A. Niftiyev:
  Non-linear eigenvalue problems for p-Laplacian with variable domain. 67-84
  
• S. J. Li, P. Zhao:
  A method of duality for a mixed vector equilibrium problem. 85-96
  
• Janine Mukuddem-Petersen, M. P. Mulaudzi, Mark Adam Petersen, I. M. Schoeman:
  Optimal mortgage loan securitization and the subprime crisis. 97-115
  
• Zi Xu:
  A combined direction stochastic approximation algorithm. 117-129
  
• Marco D'Apuzzo, Valentina de Simone, Daniela di Serafino:
  Starting-point strategies for an infeasible potential reduction method. 131-146
  
• S. Mehdi Hashemi, Shaghayegh Mokarami, Ebrahim Nasrabadi:
  Dynamic shortest path problems with time-varying costs. 147-156
  

Volume 4, Number 2, May 2010

• Hainan Sun, Huei Chuen Huang, Wikrom Jaruphongsa:
  The economic lot scheduling problem under extended basic period and power-of-two policy. 157-172
  
• Remigijus Paulavicius, Julius Zilinskas, Andreas Grothey:
  Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds. 173-183
  
• José Brito, Nelson Maculan, Maurício Lila, Flávio Montenegro:
  An exact algorithm for the stratification problem with proportional allocation. 185-195
  
• Giorgio Gnecco, Marcello Sanguineti:
  Error bounds for suboptimal solutions to kernel principal component analysis. 197-210
  
• Anurag Jayswal, Dilip Kumar, Rajnish Kumar:
  Second order duality for nondifferentiable multiobjective programming problem involving (F, alpha, rho, d)-V-type I functions. 211-226
  
• Ming Liu, Chengbin Chu, Yinfeng Xu, Feifeng Zheng:
  An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times. 227-237
  
• Wei-Ming Wang, Amy H. I. Lee, Ding-Tsair Chang:
  An integrated FDM-ANP evaluation model for sustainable development of housing community. 239-257
  
• Laura Scrimali:
  A variational inequality formulation of the environmental pollution control problem. 259-274
  
• Kimmo Berg, Harri Ehtamo:
  Interpretation of Lagrange multipliers in nonlinear pricing problem. 275-285
  
• Jiri Rohn:
  A residual existence theorem for linear equations. 287-292
  
• T. R. Gulati, Geeta Mehndiratta:
  Nondifferentiable multiobjective Mond-Weir type second-order symmetric duality over cones. 293-309
  

Volume 4, Number 3, August 2010

• Balabhaskar Balasundaram, Shyam Sundar Chandramouli, Svyatoslav Trukhanov:
  Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes. 311-320
  
• Xiaofeng Gao, Wei Wang, Zhao Zhang, Shiwei Zhu, Weili Wu:
  A PTAS for minimum d-hop connected dominating set in growth-bounded graphs. 321-333
  
• Yiwei Wu, Xiaofeng Gao, Yingshu Li:
  A framework of distributed indexing and data dissemination in large scale wireless sensor networks. 335-345
  
• Weili Wu, Xiaofeng Gao, Panos M. Pardalos, Ding-Zhu Du:
  Wireless networking, dominating and packing. 347-358
  
• Yinying Yang, Mihaela Cardei:
  Adaptive energy efficient sensor scheduling for wireless sensor networks. 359-369
  
• Zheng Fang, Jie Wang:
  Hybrid approximation for minimum-cost target coverage in wireless sensor networks. 371-381
  
• Donghyun Kim, Wei Wang, Ling Ding, Jihwan Lim, Heekuck Oh, Weili Wu:
  Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks. 383-392
  
• Incheol Shin, Yilin Shen, My T. Thai:
  On approximation of dominating tree in wireless sensor networks. 393-403
  
• X. Xu, Y. Wang, H. Du, P.-J. Wan, F. Zou, X. Li, W. Wu:
  Approximations for node-weighted Steiner tree in unit disk graphs. 405-416
  
• Sheng-Long Hu, Zheng-Hai Huang:
  A note on absolute value equations. 417-424
  
• Q. L. Wang, S. J. Li, K. L. Teo:
  Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization. 425-437
  
• Qinghong Zhang:
  Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming. 439-447
  
• Abdellatif Moudafi:
  A partial complement method for approximating solutions of a primal dual fixed-point problem. 449-456
  
• Cristinel Mortici:
  Monotonicity properties of the volume of the unit ball in \mathbbRⁿ{\mathbb{R}^{n}}. 457-464
  
• Immanuel M. Bomze, Florian Jarre:
  A note on Burer's copositive representation of mixed-binary QPs. 465-472
  

Volume 4, Number 4, November 2010

• Jonathan M. Borwein:
  Fifty years of maximal monotonicity. 473-490
  
• Igor V. Konnov:
  Sign reversion approach to concave minimization problems. 491-500
  
• Jian-Wen Peng, Soon-Yi Wu:
  The generalized Tykhonov well-posedness for system of vector quasi-equilibrium problems. 501-512
  
• Muhammad Aslam Noor, Khalida Inayat Noor, Eisa A. Al-Said:
  Iterative methods for solving general quasi-variational inequalities. 513-530
  
• Ali Ahrari, Reza Ahrari:
  On the utility of randomly generated functions for performance evaluation of evolutionary algorithms. 531-541
  
• Chrysovalantis Gaganis, Fotios Pasiouras, Michael Doumpos, Constantin Zopounidis:
  Modelling banking sector stability with multicriteria approaches. 543-558
  
• O. L. Mangasarian, Michael C. Ferris:
  Uniqueness of integer solution of linear equations. 559-565
  
• Camilo Ortiz, René Meziat:
  Semidefinite relaxations of dynamical programs under discrete constraints. 567-583
  
• Charles Audet, Xavier Fournier, Pierre Hansen, Frédéric Messine:
  A note on diameters of point sets. 585-595
  
• Vsevolod I. Ivanov:
  Second-order optimality conditions for inequality constrained problems with locally Lipschitz data. 597-608
  
• Alla R. Kammerdiner, Pavlo A. Krokhmal, Panos M. Pardalos:
  On the Hamming distance in combinatorial optimization problems on hypergraph matchings. 609-617
  
• Luciana S. Buriol, Michael J. Hirsch, Panos M. Pardalos, Tania Querido, Mauricio G. C. Resende, Marcus Ritt:
  A biased random-key genetic algorithm for road congestion minimization. 619-633
  
• O. A. Boikanyo, Gheorghe Morosanu:
  A proximal point algorithm converging strongly for general errors. 635-641
  

Last update Tue May 21 19:28:01 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page