1. Matrices with lexicographically-ordered rows

   • Gustavo Angulo

   Original Paper 07 December 2018 Pages: 235 - 248

   

2. Selection of a covariance function for a Gaussian random field aimed for modeling global optimization problems

   • Anatoly Zhigljavsky
   • Antanas Žilinskas

   Original Paper 02 January 2019 Pages: 249 - 259

   

3. Stochastic \(R_0\) tensors to stochastic tensor complementarity problems

   • Maolin Che
   • Liqun Qi
   • Yimin Wei

   Original Paper 15 November 2018 Pages: 261 - 279

4. Inverse optimization for multi-objective linear programming

   • Mostafa Naghavi
   • Ali Asghar Foroughi
   • Masoud Zarepisheh

   Original paper 30 January 2019 Pages: 281 - 294

   

5. An approach to calmness of linear inequality systems from Farkas lemma

   • M. J. Cánovas
   • N. Dinh
   • J. Parra

   Original Paper 28 January 2019 Pages: 295 - 307

6. A new global optimization technique by auxiliary function method in a directional search

   • Ahmet Sahiner
   • Shehab A. Ibrahem

   Original Paper 22 August 2018 Pages: 309 - 323

   

7. Convexity and closedness in stable robust duality

   • N. Dinh
   • M. A. Goberna
   • M. Volle

   Original Paper 09 August 2018 Pages: 325 - 339

8. A 4-approximation algorithm for k-prize collecting Steiner tree problems

   • Yusa Matsuda
   • Satoshi Takahashi

   Original Paper 05 December 2018 Pages: 341 - 348

   

9. Conjugate duality for constrained optimization via image space analysis and abstract convexity

   • C. L. Yao
   • S. J. Li

   Original Paper 28 November 2018 Pages: 349 - 366

   

10. An efficient method for joint product line selection and pricing with fixed costs

    • Jungju Park
    • Jeonghoon Mo

    Original Paper 15 November 2018 Pages: 367 - 378

    

11. New formulations for Variable Cost and Size Bin Packing Problems with Item Fragmentation

    • Marco Casazza

    Original Paper 18 September 2018 Pages: 379 - 398

    

12. Characterizing nonconvex constrained best approximation using Robinson’s constraint qualification

    • Hossein Mohebi
    • Morteza Sheikhsamani

    Original Paper 22 August 2018 Pages: 399 - 417

13. An efficient case for computing minimum linear arboricity with small maximum degree

    • Huijuan Wang
    • Lidong Wu
    • Bin Liu

    Original Paper 31 May 2018 Pages: 419 - 428

14. A mathematical programming formulation for the Hartree–Fock problem on open-shell systems

    • Leo Liberti
    • Carlile Lavor
    • Nelson Maculan

    Original Paper 08 January 2019 Pages: 429 - 437

15. A note on surjectivity of piecewise affine mappings

    • Manuel Radons

    Short Communication 05 May 2018 Pages: 439 - 443

    

16. On approximating maximum covering cycles in undirected graphs

    • Dirk Briskorn

    Short Communication 02 July 2018 Pages: 445 - 448