Alex S. Belenky

According to our database1, Alex S. Belenky authored at least 16 papers between 2003 and 2015.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of six.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
An Approach to Forming and Managing a Portfolio of Financial Securities by Small and Medium Price-Taking Traders in a Stock Exchange.
Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015

2014
Finding Optimal Production and Selling Strategies for an Electricity Generator in a Part of a Country's Electrical Grid.
Proceedings of the Second International Conference on Information Technology and Quantitative Management, 2014

2013
Three Quantitative Management Problems in Public Procurement and Decision Procedures for their Analysis and Solving.
Proceedings of the First International Conference on Information Technology and Quantitative Management, 2013

2012
A Boolean programming problem of choosing an optimal portfolio of projects and optimal schedules for them by reinvesting within the portfolio the profit from project implementation.
Appl. Math. Lett., 2012

2008
Forthcoming: How America Chooses Its Presidents, Second Edition, by Alexander S. Belenky.
Math. Comput. Model., 2008

A modified "winner-take-all" rule for awarding state electoral votes in US presidential elections and a game model for its analysis.
Math. Comput. Model., 2008

From the editor: Systems studies of voting systems and elections.
Math. Comput. Model., 2008

A 0-1 knapsack model for evaluating the possible Electoral College performance in two-party US presidential elections.
Math. Comput. Model., 2008

2007
A mathematical model for estimating the potential margin of state undecided voters for a candidate in a US Federal election.
Math. Comput. Model., 2007

Estimating the size of the calling population in finite-source election queues by bilinear programming techniques.
Math. Comput. Model., 2007

Finding the exact lower estimate of the maximin of a minimum function on a polyhedron of connected variables.
Appl. Math. Lett., 2007

The continuity of two functions associated with a maximin problem with connected variables.
Appl. Math. Lett., 2007

2006
Two Rules of a Sealed Ceiling Bid and Their Analysis by Mathematical Programming Techniques.
Comput. Math. Appl., 2006

2004
The solvability of a set partitioning problem and a logical mistake in article 2 of the U.S. Constitution.
Math. Comput. Model., 2004

2003
Choosing a preferable strategy by the surrounding of a coalition in n-person games.
Appl. Math. Lett., 2003

Two noncooperative games between a coalition and its surrounding in a class of n-person games with constant sum.
Appl. Math. Lett., 2003


  Loading...