1. On evolution of an information dynamic system and its generating operator

   • Roman V. Belavkin

   Original Paper 17 April 2011 Pages: 827 - 840

2. Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function

   • Jean-Baptiste Hiriart-Urruty
   • Hai Yen Le

   Original Paper 22 March 2011 Pages: 841 - 849

3. An algorithm for computing all solutions of an absolute value equation

   • Jiri Rohn

   Original Paper 23 March 2011 Pages: 851 - 856

4. Separable standard quadratic optimization problems

   • Immanuel M. Bomze
   • Marco Locatelli

   Original Paper 26 March 2011 Pages: 857 - 866

5. The perspective of a bank in granting credits: an optimization model

   • Roy Cerqueti
   • Anna Grazia Quaranta

   Original Paper 27 March 2011 Pages: 867 - 882

6. Parameterized computational complexity of finding small-diameter subgraphs

   • Alexander Schäfer
   • Christian Komusiewicz
   • Rolf Niedermeier

   Original Paper 05 April 2011 Pages: 883 - 891

7. Complexity of necessary efficiency in interval linear programming and multiobjective linear programming

   • Milan Hladík

   Original Paper 07 April 2011 Pages: 893 - 899

8. On Lagrangian duality in vector optimization: applications to the linear case

   • Elisa Pagani

   Original Paper 08 April 2011 Pages: 901 - 914

9. Modelling transfer line design problem via a set partitioning problem

   • Pavel Borisovsky
   • Alexandre Dolgui
   • Sergey Kovalev

   Original Paper 08 April 2011 Pages: 915 - 926

10. A unified local convergence analysis of inexact constrained Levenberg–Marquardt methods

    • Roger Behling
    • Andreas Fischer

    Original Paper 13 April 2011 Pages: 927 - 940

11. Conjugate gradient methods using value of objective function for unconstrained optimization

    • Hideaki Iiduka
    • Yasushi Narushima

    Original Paper 20 April 2011 Pages: 941 - 955

12. Convergence theorem of common fixed points for a family of nonspreading mappings in Hilbert space

    • Atid Kangtunyakarn

    Original Paper 13 April 2011 Pages: 957 - 961

13. Optimization by ant algorithms: possible roles for an individual ant

    • Nicolas Zufferey

    Original Paper 20 April 2011 Pages: 963 - 973

14. A new supermemory gradient method for unconstrained optimization problems

    • Yi-gui Ou
    • Guan-shu Wang

    Original Paper 17 April 2011 Pages: 975 - 992

15. An optimum multivariate stratified double sampling design in presence of non-response

    • Rahul Varshney
    • Najmussehar
    • M. J. Ahsan

    Original Paper 21 April 2011 Pages: 993 - 1008

16. On two questions of optimization theory concerning quadratic mappings

    • A. V. Arutyunov

    Original Paper 28 April 2011 Pages: 1009 - 1015

17. On Rump’s characterization of P-matrices

    • Jiri Rohn

    Short Communication 07 April 2011 Pages: 1017 - 1020

18. A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times

    • Radosław Rudek

    Short Communication Open access 27 April 2011 Pages: 1021 - 1025

19. On an iterative method for solving absolute value equations

    • Muhammad Aslam Noor
    • Javed Iqbal
    • Eisa Al-Said

    Short Communication 26 May 2011 Pages: 1027 - 1033