Top (journal of operations research)

• 

  Año 2022, Vol. 30, Número 2

  • Seleccionado

    An adaptative bacterial foraging optimization algorithm for solving the MRCPSP with discounted cash fows

    Luis F. Machado Domínguez, Carlos D. Paternina Arboleda, Jorge I. Vélez, Agustín Barrios Sarmiento

    • Resumen
    • Texto completo

    págs. 221-248

    
  • Seleccionado

    An approach to characterizing €‑solution sets of convex programs

    N. V. Tuyen, C. F. Wen, T.Q. Son

    • Resumen
    • Texto completo

    págs. 249-269

    
  • Seleccionado

    The DTC (diference of tangentially convex functions) programming: optimality conditions

    F. Mashkoorzadeh, N. Movahedian, Soghra Nobakhtian

    • Resumen
    • Texto completo

    págs. 270-295

    
  • Seleccionado

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

    John Martinovic, Markus Hähnel, Guntram Scheithauer, Waltenegus Dargie

    • Resumen
    • Texto completo

    págs. 296-331

    
  • Seleccionado

    A bankruptcy approach to solve the fxed cost allocation problem in transport systems

    Fatemeh Babaei, Hamidreza Navidi, Stefano Moretti

    • Resumen
    • Texto completo

    págs. 332-358

    
  • Seleccionado

    A sequential partition method for non‑cooperative games of bankruptcy problems

    Doudou Gong, Genjiu Xu, Xuanzhu Jin, Loyimee Gogoi

    • Resumen
    • Texto completo

    págs. 359-379

    
  • Seleccionado

    The effect of consolidated periods in heterogeneous lotsizing games

    Luis A. Guardiola Alcalá, Ana Meca Martínez , Justo Puerto Albandoz

    • Resumen
    • Texto completo

    págs. 380-404

    
  • Seleccionado

    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

    • Resumen
    • Texto completo

    págs. 405-425