Buenos Aires, Provincia de Buenos Aires, Argentina
2 mil seguidores Más de 500 os

Unirse para ver el perfil

Acerca de

I am ionate about solving hard problems and creating outstanding software products…

Actividad

Experiencia y educación

  • InvGate

Mira la experiencia completa de Federico

Mira su cargo, antigüedad y más

o

Al hacer clic en «Continuar» para unirte o iniciar sesión, aceptas las Condiciones de uso, la Política de privacidad y la Política de cookies de LinkedIn.

Licencias y certificaciones

Experiencia de voluntariado

  • Teacher

    Universidad de Buenos Aires

    - actualidad 16 años

    Educación

    A workshop to introduce programming and some cryptografic techniques and algorithms to high school students

Publicaciones

  • An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint

    Optimization and Engineering: Volume 16, Issue 3 (2015), Page 605-632

    We study integer programming formulations for the 2-schemes strip cutting problem with a sequencing constraint (2-SSsc) considered by Rinaldi and Franz. The 2-SSsc arises in the context of corrugated cardboard production, which involves cutting strips of large lengths into rectangles of at most (usually) two different lengths. Because of buffer restrictions, in the 2-SSsc these strips must be sequenced in such a way that, at any moment, at most two types of items are in production and not…

    We study integer programming formulations for the 2-schemes strip cutting problem with a sequencing constraint (2-SSsc) considered by Rinaldi and Franz. The 2-SSsc arises in the context of corrugated cardboard production, which involves cutting strips of large lengths into rectangles of at most (usually) two different lengths. Because of buffer restrictions, in the 2-SSsc these strips must be sequenced in such a way that, at any moment, at most two types of items are in production and not completed yet. This problem is NP-hard. We present four integer programming formulations for this problem, and our computational experiments with real-life instances show that one of them has a very tight integrality gap. We propose a heuristic procedure based on this formulation and present computational experience showing that this procedure finds very good primal solutions in small running times.

    Otros autores
    Ver publicación

Reconocimientos y premios

  • Best Licentiate Thesis

    Departamento de Computación

    My thesis: Models and combinatorial optimization algorithms for planning routes in sailboat races was awarded as the Best Licentiate Thesis of 2010 by the Computer Science Department

Idiomas

  • Spanish

    Competencia bilingüe o nativa

  • English

    Competencia profesional completa

Recomendaciones recibidas

Ver el perfil completo de Federico

  • Descubrir a quién conocéis en común
  • Conseguir una presentación
  • ar con Federico directamente
Unirse para ver el perfil completo

Perfiles similares

Otras personas con el nombre de Federico Martinez en Argentina

Añade nuevas aptitudes con estos cursos