1. An adaptative bacterial foraging optimization algorithm for solving the MRCPSP with discounted cash flows

   • Luis F. Machado-Domínguez
   • Carlos D. Paternina-Arboleda
   • Agustín Barrios-Sarmiento

   Original Paper 25 June 2021 Pages: 221 - 248

   

2. An approach to characterizing \(\epsilon \)-solution sets of convex programs

   • N. V. Tuyen
   • C.-F. Wen
   • T. Q. Son

   Original Paper 02 August 2021 Pages: 249 - 269

3. The DTC (difference of tangentially convex functions) programming: optimality conditions

   • F. Mashkoorzadeh
   • N. Movahedian
   • S. Nobakhtian

   Original Paper 06 August 2021 Pages: 270 - 295

   

4. An introduction to stochastic bin packing-based server consolidation with conflicts

   • John Martinovic
   • Markus Hähnel
   • Waltenegus Dargie

   Original Paper Open access 19 August 2021 Pages: 296 - 331

   

5. A bankruptcy approach to solve the fixed cost allocation problem in transport systems

   • Fatemeh Babaei
   • Hamidreza Navidi
   • Stefano Moretti

   Original Paper 25 August 2021 Pages: 332 - 358

   

6. A sequential partition method for non-cooperative games of bankruptcy problems

   • Doudou Gong
   • Genjiu Xu
   • Loyimee Gogoi

   Original Paper 26 August 2021 Pages: 359 - 379

7. The effect of consolidated periods in heterogeneous lot-sizing games

   • Luis A. Guardiola
   • Ana Meca
   • Justo Puerto

   Original Paper Open access 09 September 2021 Pages: 380 - 404

8. An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks

   • Marta Pascoal
   • José Craveirinha
   • João Clímaco

   Original Paper Open access 14 September 2021 Pages: 405 - 425