New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm R. PaulavičiusC. S. Adjiman OriginalPaper Open access 31 January 2020 Pages: 197 - 225
Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem Santanu S. DeyBurak KocukAsteroide Santana OriginalPaper 22 October 2019 Pages: 227 - 272
Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps Nithirat SisaratRabian WangkeereeTamaki Tanaka OriginalPaper 07 December 2019 Pages: 273 - 287
Order cancellation law in the family of bounded convex sets J. GrzybowskiR. Urbański OriginalPaper 19 December 2019 Pages: 289 - 300
Globally minimizing the sum of a convex–concave fraction and a convex function based on wave-curve bounds Yong XiaLongfei WangXiaohui Wang OriginalPaper 20 January 2020 Pages: 301 - 318
Approximation algorithms for capacitated partial inverse maximum spanning tree problem Xianyue LiZhao ZhangDing-Zhu Du OriginalPaper 04 November 2019 Pages: 319 - 340
An exact completely positive programming formulation for the discrete ordered median problem: an extended version J. Puerto OriginalPaper 09 December 2019 Pages: 341 - 359
Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem Md Sarowar MorshedMd Saiful IslamMd. Noor-E-Alam OriginalPaper 24 October 2019 Pages: 361 - 382
An enhanced formulation for solving graph coloring problems with the Douglas–Rachford algorithm Francisco J. Aragón ArtachoRubén CampoyVeit Elser OriginalPaper 13 January 2020 Pages: 383 - 403
Linear conditioning, weak sharpness and finite convergence for equilibrium problems Luong Van NguyenQamrul Hasan AnsariXiaolong Qin OriginalPaper 10 January 2020 Pages: 405 - 424