Articles

• METAHEURISTIC APPROACHES FOR THE BERTH ALLOCATION PROBLEM

  Nataša KOVAČ

  265–289

  • DOI: 10.2298/YJOR160518001K
• USING INJECTION POINTS IN REFORMULATION LOCAL SEARCH FOR SOLVING CONTINUOUS LOCATION PROBLEMS

  Jack BRIMBERG, Zvi DREZNER, Nenad MLADENOVIĆ, Said SALHI

  291-300

  • DOI: 10.2298/YJOR160517018B
• VARIABLE NEIGHBORHOOD FORMULATION SEARCH APPROACH FOR THE MULTI-ITEM CAPACITATED LOT-SIZING PROBLEM WITH TIME WINDOWS AND SETUP TIMES

  Ridha ERROMDHANI, Bassem JARBOUI, Mansour EDDALY, Abdelwaheb REBAI, Nenad MLADENOVIC

  301–322

  • DOI: 10.2298/YJOR160417017E
• HITTING TIMES OF LOCAL AND GLOBAL OPTIMA IN GENETIC ALGORITHMS WITH VERY HIGH SELECTION PRESSURE

  Anton V. EREMEEV

  323–339

  • DOI: 10.2298/YJOR160318016E
• The Capacitated m Two Node Survivable Star Problem

  Gabriel Baya, Antonio Mauttone, Franco Robledo

  341–366

  • DOI: 10.2298/YJOR151115015B
• SOME VARIANTS OF REVERSE SELECTIVE CENTER LOCATION PROBLEM ON TREES UNDER THE CHEBYSHEV AND HAMMING NORMS

  Roghayeh ETEMAD, Behrooz ALIZADEH

  367–384

  • DOI: 10.2298/YJOR160317012E
• A NOTE ON ENTROPY OF LOGIC

  Marija BORICIC

  385–390

  • DOI: 10.2298/YJOR151025011B