default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlex S. Belenky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c3]Alexander S. Belenky, Lyudmila G. Egorova
:
An Approach to Forming and Managing a Portfolio of Financial Securities by Small and Medium Price-Taking Traders in a Stock Exchange. MCO (1) 2015: 257-268- 2014
- [c2]Alex S. Belenky:
Finding Optimal Production and Selling Strategies for an Electricity Generator in a Part of a Country's Electrical Grid. ITQM 2014: 1150-1159 - 2013
- [c1]Alex S. Belenky:
Three Quantitative Management Problems in Public Procurement and Decision Procedures for their Analysis and Solving. ITQM 2013: 1142-1153 - 2012
- [j13]Alex S. Belenky:
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. 25(10): 1279-1284 (2012)
2000 – 2009
- 2008
- [j12]Alex S. Belenky:
A 0-1 knapsack model for evaluating the possible Electoral College performance in two-party US presidential elections. Math. Comput. Model. 48(5-6): 665-676 (2008) - [j11]Alex S. Belenky:
From the editor: Systems studies of voting systems and elections. Math. Comput. Model. 48(9-10): 1295-1297 (2008) - [j10]Alex S. Belenky:
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. 48(9-10): 1308-1325 (2008) - [j9]Alex S. Belenky:
Forthcoming: How America Chooses Its Presidents, Second Edition, by Alexander S. Belenky. Math. Comput. Model. 48(9-10): 1663-1665 (2008) - 2007
- [j8]Alex S. Belenky:
The continuity of two functions associated with a maximin problem with connected variables. Appl. Math. Lett. 20(7): 773-777 (2007) - [j7]Alex S. Belenky:
Finding the exact lower estimate of the maximin of a minimum function on a polyhedron of connected variables. Appl. Math. Lett. 20(7): 795-799 (2007) - [j6]Alex S. Belenky, David C. King:
A mathematical model for estimating the potential margin of state undecided voters for a candidate in a US Federal election. Math. Comput. Model. 45(5-6): 585-593 (2007) - [j5]Alex S. Belenky:
Estimating the size of the calling population in finite-source election queues by bilinear programming techniques. Math. Comput. Model. 45(7-8): 873-882 (2007) - 2006
- [j4]Alex S. Belenky:
Two Rules of a Sealed Ceiling Bid and Their Analysis by Mathematical Programming Techniques. Comput. Math. Appl. 52(12): 1711-1732 (2006) - 2004
- [j3]Alex S. Belenky:
The solvability of a set partitioning problem and a logical mistake in article 2 of the U.S. Constitution. Math. Comput. Model. 40(1-2): 1-3 (2004) - 2003
- [j2]Alex S. Belenky:
Two noncooperative games between a coalition and its surrounding in a class of n-person games with constant sum. Appl. Math. Lett. 16(5): 683-687 (2003) - [j1]Alex S. Belenky:
Choosing a preferable strategy by the surrounding of a coalition in n-person games. Appl. Math. Lett. 16(5): 689-694 (2003)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
