Researchers from the HSE Faculty of Economic Sciences have shown that the accuracy of birth rate forecasts for Russia can be improved by almost 50% by incorporating the dynamics of online search queries related to pregnancy and childbirth into forecasting models. In the best-performing models, the forecasting error fell from 4.6% to 3.2%. The findings have been published in Populations and Economics.
Around one-third of Russians (31.3%) rarely eat out or buy ready-made meals. The core group of active consumers—those who eat out or purchase prepared food almost every day or several times a week—accounts for only about 9% of the population. These are the findings of a study conducted by the HSE Institute for Social Policy. According to the researchers eating out is no longer a marker of high social status in Russia.
HSE University and the Russia Renewable Energy Development Association (RREDA) have signed a partnership and information cooperation agreement to support Renewable Energy of the Planet—2026, a national competition with international participation for students and early-career researchers. Applications are open on the competition's website until September 20, 2026.
Kvaratskhelia A., Lazarev A. A., , in: European Chapter on Combinatorial Optimization (ECCO 2009).: Jerusalem: [б.и.], 2009. P. 13–14.
We consider the minimizing total weighted completion time in preemptive equal job length scheduling problem on a single machine with release dates. We propose a polynomial time algorithm that solves the problem. Before this paper, the problem is known to be open. ...
Lazarev A. A., , in: European Chapter on Combinatorial Optimization (ECCO 2009).: Jerusalem: [б.и.], 2009. P. 23–23.
We consider the scheduling problems α|β|Fmax: A set of n jobs J1,…,Jn with release dates r1,…,rn, processing times p1,…,pn and due dates d1,…,dn has to be scheduled on a single or many machines. The job preemption is not allowed. The goal is to find aschedule that minimizes the regular function F(C1,…,Cn), that Cj is the ...
Lazarev A. A., , in: European Chapter on Combinatorial Optimization (ECCO 2009).: Jerusalem: [б.и.], 2009. P. 13–13.
In this paper, for $NP$-hardness single and multi-machine scheduling problems with the criterion of minimization maximum lateness the metrics $\rho$ has been used. We consider some approaches finding of the approximate solution for the problems. The idea of approaches consists in construction to a initial instance $A$ such instance $B$ (with the same number of ...