Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ أكثر حفظ في قائمتي
  • معلومة اضافية
    • Contributors:
      Laboratoire d'Informatique de Paris-Nord (LIPN); Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord
    • بيانات النشر:
      HAL CCSD
      Elsevier
    • الموضوع:
      2019
    • Collection:
      Université Paris 13: HAL
    • Relation:
      hal-03488296; https://hal.science/hal-03488296; https://hal.science/hal-03488296/document; https://hal.science/hal-03488296/file/S1572528617302682.pdf; PII: S1572-5286(17)30268-2
    • الرقم المعرف:
      10.1016/j.disopt.2019.05.001
    • الدخول الالكتروني :
      https://doi.org/10.1016/j.disopt.2019.05.001
      https://hal.science/hal-03488296
      https://hal.science/hal-03488296/document
      https://hal.science/hal-03488296/file/S1572528617302682.pdf
    • Rights:
      http://creativecommons.org/licenses/by-nc/ ; info:eu-repo/semantics/OpenAccess
    • الرقم المعرف:
      edsbas.A04F049E