Volume 7, Issue 1, January 2013

ISSN: 1862-4472 (Print) 1862-4480 (Online)

In this issue (17 articles)

  1. Editorial

    Editorial

    Pavlo A. Krokhmal, Oleg A. Prokopyev Pages 1-2
    Download PDF (79KB) View Article

  2. Editorial

    Comments from the departing editor

    P. M. Pardalos Pages 3-4
    Download PDF (70KB) View Article

  3. No Access

    Original Paper

    One-dimensional center-based l 1-clustering method

    Kristian Sabo, Rudolf Scitovski, Ivan Vazler Pages 5-22
    Look Inside Get Access

  4. No Access

    Original Paper

    An exact penalty function method for nonlinear mixed discrete programming problems

    Changjun Yu, Kok Lay Teo, Yanqin Bai Pages 23-38
    Look Inside Get Access

  5. No Access

    Original Paper

    Coordinating multi-location production and customer delivery

    Eun-Seok Kim, Daniel Oron Pages 39-50
    Look Inside Get Access

  6. No Access

    Original Paper

    An incremental primal–dual method for nonlinear programming with special structure

    Nicolas P. Couellan, Theodore B. Trafalis Pages 51-62
    Look Inside Get Access

  7. No Access

    Original Paper

    Mixed-integer second-order cone programming for lower hedging of American contingent claims in incomplete markets

    Mustafa Ç. Pınar Pages 63-78
    Look Inside Get Access

  8. No Access

    Original Paper

    Application of graph-theoretic approaches to the random landscapes of the three-dimensional assignment problem

    Alla Kammerdiner, Eduardo Pasiliao Pages 79-87
    Look Inside Get Access

  9. No Access

    Original Paper

    Efficient multi-objective tabu search for emergency equipment maintenance scheduling in disaster rescue

    Yujun Zheng, Shengyong Chen, Haifeng Ling Pages 89-100
    Look Inside Get Access

  10. No Access

    Original Paper

    An enumerative algorithm for solving nonconvex dynamic DEA models

    M. Soleimani-damaneh Pages 101-115
    Look Inside Get Access

  11. No Access

    Original Paper

    A note on characterizing solution set of nonsmooth pseudoinvex optimization problem

    K. Q. Zhao, X. Wan, X. M. Yang Pages 117-126
    Look Inside Get Access

  12. No Access

    Original Paper

    Optimality via generalized approximate convexity and quasiefficiency

    Davinder Bhatia, Anjana Gupta, Pooja Arora Pages 127-135
    Look Inside Get Access

  13. No Access

    Original Paper

    Privacy-preserving horizontally partitioned linear programs with inequality constraints

    Wei Li, Haohao Li, Chongyang Deng Pages 137-144
    Look Inside Get Access

  14. No Access

    Original Paper

    Best proximity points: approximation and optimization

    S. Sadiq Basha, N. Shahzad, R. Jeyaraj Pages 145-155
    Look Inside Get Access

  15. No Access

    Original Paper

    α-Coverage to extend network lifetime on wireless sensor networks

    Monica Gentili, Andrea Raiconi Pages 157-172
    Look Inside Get Access

  16. No Access

    Original Paper

    Henig proper generalized vector quasiequilibrium problems

    Pham Huu Sach Pages 173-184
    Look Inside Get Access

  17. No Access

    Original Paper

    Weak and strong convergence of an inertial proximal method for solving Ky Fan minimax inequalities

    Zaki Chbani, Hassan Riahi Pages 185-206
    Look Inside Get Access