Buscar
Mostrando ítems 21-30 de 2576
Recurrent dynamic programmingRecurrent dynamic programming
(Universidade Federal de Santa Maria, 2000)
A branch-and-cut algorithm for the latent-class logit assortment problem
(Elsevier Science, 2012-03)
We study the product assortment problem of a retail operation that faces a stream of customers who are heterogeneous with respect to preferences. Each customer belongs to a market segment characterized by a consideration ...
Modeling of discrete/continuous optimization problems: Characterization and formulation of disjunctions and their relaxations
(Pergamon-Elsevier Science Ltd, 2003-03-15)
This paper addresses the relaxations in alternative models for disjunctions, big-M and convex hull model, in order to develop guidelines and insights when formulating Mixed-Integer Non-Linear Programming (MINLP), Generalized ...
Strategies for motivation and integration in the first year of university: Innovation through problem solving and collaborative workEstrategias para la motivación e integración en el primer año universitario: Innovación mediante resolución de problemas y trabajo colaborativo
(Universidad Nacional de Córdoba, Faculdad de Ciencias Sociales, Centro de Estudios Avanzados. Maestría en Procesos Educativos Mediados por Tecnología, 2016)
Scheduling Argentina's professional basketball leagues: A variation on the Travelling Tournament Problem
(Elsevier Science, 2019-06-16)
Operations research methods are applied to design the season schedules of Argentina's professional basketball leagues using a format adopted in 2014 by the top two divisions. Following the setup used by the National ...