Buscar
Mostrando ítems 1-10 de 75238
Advancing research on loyalty programs: a future research agenda
(Springer, 2015)
Despite the growing literature on loyalty program (LP) research, many
questions remain underexplored. Driven by advancements in information technology,
marketing analytics, and consumer interface platforms (e.g., ...
Building & sustaining a digital government research center: A director's perspective
(Association for Computing Machinery, 2017)
This panel provides participants a chance to interact with five digital government research center directors about their experiences in building sustainable digital government research centers. Panelists, selected to provide ...
CGIAR Research Program on Maize: an Agri-Food System CGIAR Program Annual Report 2017
(CGIAR Research Program on Maize, 2019)
Conducting action research projects in a teacher preparation program.
(2011-10-18)
This article deals with a study carried out at Universidad de Caldas, a public institution for higher education in Colombia, South America. The purpose is to state the impact of the Action Research Model on the professional ...
Programmer Experience: A Systematic Mapping
(IEEE Computer Society, 2020)
An integer linear programming approach for bilinear integer programming
(ELSEVIER SCIENCE BVAMSTERDAM, 2012)
We introduce a new Integer Linear Programming (ILP) approach for solving Integer Programming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the ...
The research program at AIGLE
(Universidad de Belgrano. Facultad de Humanidades. Proyectos de Investigación, 1998)
Presents the research program of a clinical center, the AIGLE Foundation in Buenos Aires, Argentina. The authors describe the potentialities and advantages of research in this context. H. M. Fernández-Alvarez et al also ...
On the solution of mathematical programming problems with equilibrium constraints
(2002-02-01)
Mathematical programming problems with equilibrium constraints (MPEC) are nonlinear programming problems where the constraints have a form that is analogous to first-order optimality conditions of constrained optimization. ...