Adolfo Sánchez-Flores

Learn More
Although special cases of the one-dimensional space allocation problem (ODSAP) have been efficiently solved, like the so-called linear ordering problem with independent destinations, or the all prominent matrix case, the general problem appears redoubtable. So far, the use of known exact algorithms has been limited to small size problems, and for bigger(More)
  • 1