Matrices with lexicographically-ordered rows Gustavo Angulo Original Paper 07 December 2018 Pages: 235 - 248
Selection of a covariance function for a Gaussian random field aimed for modeling global optimization problems Anatoly ZhigljavskyAntanas Žilinskas Original Paper 02 January 2019 Pages: 249 - 259
Stochastic \(R_0\) tensors to stochastic tensor complementarity problems Maolin CheLiqun QiYimin Wei Original Paper 15 November 2018 Pages: 261 - 279
Inverse optimization for multi-objective linear programming Mostafa NaghaviAli Asghar ForoughiMasoud Zarepisheh Original paper 30 January 2019 Pages: 281 - 294
An approach to calmness of linear inequality systems from Farkas lemma M. J. CánovasN. DinhJ. Parra Original Paper 28 January 2019 Pages: 295 - 307
A new global optimization technique by auxiliary function method in a directional search Ahmet SahinerShehab A. Ibrahem Original Paper 22 August 2018 Pages: 309 - 323
Convexity and closedness in stable robust duality N. DinhM. A. GobernaM. Volle Original Paper 09 August 2018 Pages: 325 - 339
A 4-approximation algorithm for k-prize collecting Steiner tree problems Yusa MatsudaSatoshi Takahashi Original Paper 05 December 2018 Pages: 341 - 348
Conjugate duality for constrained optimization via image space analysis and abstract convexity C. L. YaoS. J. Li Original Paper 28 November 2018 Pages: 349 - 366
An efficient method for joint product line selection and pricing with fixed costs Jungju ParkJeonghoon Mo Original Paper 15 November 2018 Pages: 367 - 378
New formulations for Variable Cost and Size Bin Packing Problems with Item Fragmentation Marco Casazza Original Paper 18 September 2018 Pages: 379 - 398
Characterizing nonconvex constrained best approximation using Robinson’s constraint qualification Hossein MohebiMorteza Sheikhsamani Original Paper 22 August 2018 Pages: 399 - 417
An efficient case for computing minimum linear arboricity with small maximum degree Huijuan WangLidong WuBin Liu Original Paper 31 May 2018 Pages: 419 - 428
A mathematical programming formulation for the Hartree–Fock problem on open-shell systems Leo LibertiCarlile LavorNelson Maculan Original Paper 08 January 2019 Pages: 429 - 437
A note on surjectivity of piecewise affine mappings Manuel Radons Short Communication 05 May 2018 Pages: 439 - 443
On approximating maximum covering cycles in undirected graphs Dirk Briskorn Short Communication 02 July 2018 Pages: 445 - 448