Speeding up branch and bound algorithms for solving the maximum clique problem Evgeny MaslovMikhail BatsynPanos M. Pardalos OriginalPaper 16 May 2013 Pages: 1 - 21
Simplicial Lipschitz optimization without the Lipschitz constant Remigijus PaulavičiusJulius Žilinskas OriginalPaper 25 July 2013 Pages: 23 - 40
Multiobjective DC programs with infinite convex constraints Shaojian QuMark GohRobert De Souza OriginalPaper 31 July 2013 Pages: 41 - 58
Path-following gradient-based decomposition algorithms for separable convex optimization Quoc Tran DinhIon NecoaraMoritz Diehl OriginalPaper 22 June 2013 Pages: 59 - 80
A full-Newton step feasible interior-point algorithm for \(P_*(\kappa )\)-linear complementarity problems G. Q. WangC. J. YuK. L. Teo OriginalPaper 31 July 2013 Pages: 81 - 99
Subdifferential test for optimality Florence JulesMarc Lassonde OriginalPaper 07 June 2013 Pages: 101 - 106
Order statistics and region-based evolutionary computation S. PuechmorelD. Delahaye OriginalPaper 08 June 2013 Pages: 107 - 130
On penalty methods for non monotone equilibrium problems I. V. Konnov OriginalPaper 14 June 2013 Pages: 131 - 138
Stability for trust-region methods via generalized differentiation Nguyen Thanh Qui OriginalPaper 18 July 2013 Pages: 139 - 164
On the stability of the linear functional equation in a single variable on complete metric groups Soon-Mo JungDorian PopaMichael Th. Rassias OriginalPaper 18 June 2013 Pages: 165 - 171
Projected viscosity subgradient methods for variational inequalities with equilibrium problem constraints in Hilbert spaces Phan Tu VuongJean Jacques StrodiotVan Hien Nguyen OriginalPaper 19 June 2013 Pages: 173 - 190
Levitin–Polyak well-posedness for constrained quasiconvex vector optimization problems C. S. LalithaPrashanto Chatterjee OriginalPaper 31 August 2013 Pages: 191 - 205