Беленький Александр Соломонович

с 2009 года НИУ ВШЭ

• Массачусетский Технологический Институт,  Центр «Основания Инженерных Систем», научный сотрудник (2005-н.в.)
• NISTRAMAN Consulting, Старший консультант по стратегическому управлению (2003-2005)
• Институт Проблем Управления АН СССР/РАН, ведущий научный сотрудник (1996-2003) старший научный сотрудник, (1981-1995), зав. группой (1974-1981), старший инженер, инженер (1968-1977)
• Массачусетский Технологический Институт,  Центр «Исследование операций», научный сотрудник (1991-1992, 1993-1994)

• Научный консультант шести защищенных кандидатских  диссертаций  соискателей и аспирантов  в области применения математических методов в экономических и социальных системах   1982-1992

• Лектор и руководитель дипломных проектов в области применения математических методов на транспорте (Московский Институт  Инженеров Транспорта)   1982-1986 

• Лектор и руководитель дипломных проектов в области применения математических методов в машиностроении (Московский Институт Электронного Машиностроения)   1986-1988 
• Лектор и руководитель дипломных проектов в области применения математических методов в пищевой промышленности (Московский Пищевой Институт)   1981-1987 
• Приглашенный лектор, Бостонский Университет    (США)    1990
• Приглашенный лектор, Университет  им. Дж. Вашингтона, (США)    1989       
• Приглашенный лектор, Вашингтонский Университет, г.Сент-Луис, (США)    1993 
• Приглашенный лектор, Университет Эколе Цетраль, г. Париж, (Франция)   1992 
• Приглашенный лектор, Университет г. Удина (Италия)   1992
• Приглашенный лектор, Школа Математики, Университет г. Манчестера (Великобритания)   2008
• Приглашенный лектор, Институт Эконометрики, Университет г. Роттердама (Нидерланды)   2008                            
• Приглашенный лектор, Департамент  Экономики, Университет г. Гронингена (Нидерланды)  2008

• The 2004 Election: Incredible Outcomes. Brookline Bulletin, Volume 2, Issue 26, p.4; 2004

• The 2004 Election: Local polls and Campaign Strategies. BrooklineBulletin, Volume 2. Issue 29, p.4; 2004
• The 2004 Election: How It Can Be Won. Brookline Bulletin, Volume 2, Issue 35, pp.8, 10; 2004
• Teaching Mathematics at American Public Schools: What Is Left Behind?  Brookline Bulletin, Volume 2, issue 36, pp.4, 8; 2004
• Faulty system for democracy. (with R. Larson) Opinions, Boston Herald, February 12, 2007.
• Voting should not be a heroic act of patience, (with R. Larson), The Christian Science Monitor, Opinion, September 12, 2006.
• A call for creating service standards, (with R. Larson) The Boston Globe, February 20, 2007.
• Votesare cast. Make sure they're counted. New York Times, (with R. Larson) Letters to the Editor, December 13, 2006.
• The Good, the Bad, and the Ugly: Three Proposals to Introduce the Nationwide Popular Vote in U.S. Presidential Elections, Michigan Law Review, February, 2008
• Belenky: Counting Votes for President, Milford Daily News February 10, 2008
• Getting Rid of the Electoral College by Keeping It, Op-Ed News, February `13, 2008
• Massachusetts Should Reject the Popular Vote Plan, Telegram & Gazette, February 14, 2008
• Belenky: Avoid electoral crisis by putting the people first, Milford Daily News, April 4, 2008
• Electoral College system benefits Vermont voters, Rutland Herald, April 20, 2008
• Democratic race not over until superdelegates have their say, Telegram & Gazette June 3, 2008
• U.S. education system gets failing math grade, Times Argus, June 8, 2008
• Should Voters Care About the Rules of Electing a President? Op-Ed News, Sept.23, 2008
• Belenky: Making Every State a "Battleground" and Every Vote Count, Milford Daily News, October 8, 2008
• DickCheney the Next President? Times Argus, November 2, 2008
• Return BayState to election relevancy,  The Sun Chronicle. November19, 2008
• Belenky: The Achilles Heel of the popular vote plan, Daily News Tribune, January 30, 2009
• Belenky: Challenging the NPV compact, Milford Daily News, February 11, 2009
• Belenky: Mistake in math: Leaving analytical thinking behind, MetroWest Daily News, March 24, 2009
• Alexander S. Belenky: For national vote plan, all states must consent, Buffalo News, April 7, 2009
• Alexander S. Belenky: Brittle corner stones of national popular vote plan, Providence Journal, April 11, 2009
• Voting standards are the key to avoiding long lines on Election Day (with R. Larson), Plain Dealer, May 8, 2009
• Alexander S. Belenky and Richard C. Larson: The challenge of electric-grid storage, Providence Journal, February 24, 2011 

• • Как выбирают президента США (в вопросах и ответах), 2-еиздание, дополненное, Изд-во ЗАО РИЦ МДК, 2008
  • Математические модели оптимального планирования в транспортных системах,  Moсква, Изд-во ВИНИТИ, 1988,
  • Методы оптимального планирования в транспортных системах, Изд-во Знание, 1988,
  • Совершенствование планирования в транспортных системах, Изд-во Знание, 1988, 
  • Прикладная математика в народном хозяйстве, Изд-во Знание, 1985,
  • Транспортные системы: анализ возможностей и оптимизация функционирования, Изд-во Знание, 1985, 
  • Автоматизированные системы управления контейнерными перевозками, Moсква, ВИНИТИ, 1981 (соавторы: О.И. Авен и В.М. Цуркан) 

• Формирование и оптимизация структуры портфеля государственных заказов в условиях ограниченного бюджета методами математического программирования (// Экономический журнал ВШЭ, 2012. Т. 10. № 1. C. 88—104, Беленький Александр Соломонович, Кузнецова Ирина Владимировна, Чубарова Анна Викторовна, Шамрин Александр Тихонович)
• Отечественный и зарубежный опыт формирования тарифной политики на железнодорожные грузовые перевозки (// Транспорт: Наука, Техника, Управление, 2011. № 4. C. 3—11, Беленький Александр Соломонович, Резер С.М., Юнусова Александра Ивановна)
• Теоретико-игровой подход к проблеме регулирования тарифов на транзитные контейнерные перевозки на железнодорожном транспорте России (// Транспорт: Наука, Техника, Управление, 2011. № 6. C. 3—8, Беленький Александр Соломонович, Юнусова Александра Ивановна)
• О размещении заказов посредством одношаговых аукционов (// 10- я Международная научная конференция по проблемам развития экономики и общества. сборник студенческих работ, 2010. Т. 1. C. 428—440, Беленький Александр Соломонович)
• Об одном правиле определения победителя в закрытых тендерах и его математических cвойствах. Экономический Журнал  ГУ-ВШЭ, 13,1, (2009), 3-18
• О выборе правил проведения одношаговых аукционов в рамках закона 94-ФЗ (// Госзаказ: управление, размещение, обеспечение, 2009. № 3. C. 2—11, Беленький Александр Соломонович) 

и более 60 статей в советских научных  журналах. 

1. Who Will Be the Next President?: A Guide to the U.S. Presidential Election System, Springer: Heidelberg, New York, Dordrecht, London, November 2012, 151 c.)
2. Understanding the Fundamentals of the U.S. Presidential Election System, Springer: Heidelberg, New York, Dordrecht, London, April 2012, 444 c.)
3. Operations Research in Transportation Systems: Ideas and Schemes of Optimization Methods for Strategic Planning and Operations Management, 440p+xii, Springer, December, 2010
4. How America Chooses Its Presidents, 168p+xx, AuthorHouse, Second Edition, May 2009
5. Mathematical Modeling of Voting Systems and Elections: Theory and      Applications (editor) Mathematical and Computer Modelling, Vol. 48, Issues 9-10, Elsevier, November 2008
6. Winning the US Presidency: Rules of the Game and Playing by the Rules, 108p+xii, NISTRAMAN Consulting, Brookline, MA, May 2004
7. Extreme Outcomes of US Presidential Elections: The Logic of appearance, Examples, Approaches to eliminating), 158p+xiv,NISTRAMAN Consulting, Brookline, MA, September 2003

• Systems studies of voting systems and elections. Mathematical and Computer Modelling, Vol. 48, Issues 9-10, November (2008), Pages 1295-1297.
• A modified "winner-take-all" rule for awarding state electoral votes in US Presidential elections and a game model for its analysis. Mathematical and Computer Modelling,Vol. 48, Issues 9-10, November(2008), Pages 1308-1325.
• A 0-1 knapsack model for evaluating the possible Electoral College performance in two-party US presidential elections. Mathematical and Computer Modelling,Vol. 48, Issues 5-6, September(2008),Pages 665-676.
• Finding the exact lower estimate of the maximin of a minimum function on a polyhedron of connected variables. Applied MathematicsLetters, Vol.20, Issue 7, (2007), 795-799.
• The continuity of two function associated with a maximin problem with connected variables. Applied Mathematics Letters, Vol.20, Issue 7, (2007),773-777.
• Estimating the size of the calling population in finite source election queues by bilinear programming techniques. Mathematical and Computer Modeling, 45,(2007), 873-882.
• A mathematical model for estimating the potential margin of state undecided voters for a candidate in a U. S. Federal election(with David. C. King). Mathematical and Computer Modeling, 45, (2007), 585-593.
• Two rules of a sealed ceiling bid and their analysis by mathematical programming techniques. Computers and Mathematics with Applications, 52,(2006), 1711-1732.
• Calculating the minimal fraction of the popular vote to win the U. S. Presidency in the Electoral College. Computers andMathematics with Applications, 50, 5-6, (2005), 783-802.
• Competitive strategies of US Presidential candidates in election campaigns. Computers and Mathematics with Applications. Computers and Mathematics with Applications, 49, 1, (2005), 53-71.
• The solvability of a set partitioning problem and a logical mistake in Article 2 of the US Constitution. Mathematical andComputer Modelling, 40, (2004), 1-3.
• An elementary analysis of some mathematical concepts employed in and relations associated with Amendment 12 of the US Constitution. Mathematical and Computer Modelling, 39, (2004), 123-132.
• Calculating the minimal number of homogeneous objects to represent a plurality in a heterogeneous system of objects. Mathematical andComputer Modelling, 39, (2004), 119-121.
• Two noncooperative games between a coalition and its surrounding in a class of n-person games with constant sum, Applied Mathematics Letters, 16, (2003), 683-687.
• Choosing a preferable strategy by the surrounding of a coalition in n-person games, Applied Mathematics Letters, 16, (2003), 689-693.
• Cooperative games of choosing partners and forming coalitions in the marketplace, Mathematical and Computer Modelling, 36, (2002), 1279-1291.
• Analyzing the potential of a firm: an operations research approach, Mathematical and Computer Modelling, 35, (2002), 1405-1424.
• Optimization ofplanning an advertising campaign of goods and services(with I. Belenkii), Mathematical and Computer Modelling, 35, (2002), 1391-1403.
• An approach to planning an advertising campaign of goods and services, Computers and Mathematics with Applications, 42,(2001), 993-1008.
• A noncooperative game on polyhedral sets, Computers and Mathematics with Applications, 33, (1997), N10, 125-133.
• A2-persongame on a polyhedral set of connected strategies, Computers and Mathematics with Applications, 33, (1997), N6, 99-125.
• A3-person game on polyhedral sets. Computers and Mathematics with Applications, 28, (1994), N5, 53-56.
• On 2- and 3-person games on polyhedral sets.15thInternational Symposium on Mathematical Programming, Ann Arbor, 1994.
• Optimal structure of container shipping with feeder service to ports. Automation and Remote Control, 52, (1991), N1, 100-106 (with A. Dolin and S. Tkach).
• Optimization of planning in transportation systems on the basis of standard optimization methods: problems, results, directions of research, Transport; Science, Technology, Management, Moscow, 1, (1990), 26-31.
• Scheduling models and methods in optimal freight transportation planning, Automation and Remote Control, 50, (1989), N1, 1-56 (with Eu. Levner).
• An antagonistic game on polyhedral sets, Automation and Remote Control, 47, (1986), N6, 757-761.
• Search for min-max of two monotone functions on a polyhedral set, Automation and Remote Control, 43, (1982), N11, 1389-1393.
• Minimax problems with monotone functions on polyhedral sets, Automation and Remote Control, 43, (1982), N10, 1304-1314.
• Minimization of a monotone function on a polyhedral set, Automation and Remote Control, 43, (1982), N9, 1190-1197.
• Minimax planning problems with linear constraints and methods for their solving, Automation and Remote Control, 42, (1981), N10, 1409-1419.
• DISPUT: An interactive data retrieval system for planning and management in transportation. 2. System implementation. Automation and Remote Control, 42, (1981), N5, 693-701 (with L. Mikulich, E. Naidenova, A. Chervonenkis).
• DISPUT: An interactive data retrieval system for planning and management in transportation. 1. Design and operating principles. Automation and Remote Control, 42, (1981), N3, 693-701 (with L. Mikulich, E. Naidenova, A. Chervonenkis).
• Finding saddle points on convex polyhedra in minimax optimization problems with linear constraints, Automation and Remote Control, 41, (1980), N7, 1017-1022.
• On a minimax problem with linear constraints, Automation and Remote Control, 41, (1980), N4, 562-568.
• On a nonlinear planning problem, Automation and Remote Control, 40, (1980), N7, 1019-1028.
• A planning problem in a class of linear models, Automation and Remote Control, 39, (1978), N11, 1667-1673.
• Game theory methods in transportation systems analysis, 14 International Symposium on Mathematical Programming, Amsterdam, 1991.
• To Queue or Not To Queue, In a U.S. Presidential Election, that should NOT be a question! OR/MS Today, (with R. Larson),June 2006.