Minimum cost b-matching problems with neighborhoods

HIGHLIGHTS

• who: I. Espejo from the Departamento de Estadística e Investigación Operativa, Universidad de Sevilla, Seville, Spain have published the article: Minimum cost b-matching problems with neighborhoods, in the Journal: (JOURNAL)
• what: The authors propose to consider a region where the location of a node can lie, that is usually referred in the literature as neighborhood, see Arkin and Hassin , Dorrigiv et_al , Gentilini et_al among others. The authors provide SOC based formulations for these problems with non-convex neighborhoods given as the union of SOC representable sets. The main reason for this is . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.