default search action
Moshe Sniedovich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j14]Moshe Sniedovich:
Wald's mighty maximin: a tutorial. Int. Trans. Oper. Res. 23(4): 625-653 (2016) - 2012
- [j13]Moshe Sniedovich:
Black Swans, New Nostradamuses, Voodoo decision theories, and the science of decision making in the face of severe uncertainty. Int. Trans. Oper. Res. 19(1-2): 253-281 (2012) - 2011
- [j12]Marco Caserta
, Stefan Voß
Applying the corridor method to a blocks relocation problem. OR Spectr. 33(4): 915-929 (2011)
2000 – 2009
- 2004
- [j11]Leonid Churilov, Immanuel M. Bomze
Hyper sensitivity Analysis of portfolio Optimization Problems. Asia Pac. J. Oper. Res. 21(3): 297-318 (2004) - 2003
- [c5]Moshe Sniedovich:
On line educationally rich modules: an overview of IFORS tutORial project. CE 2003: 1207-1211 - [c4]Moshe Sniedovich:
The role of games and puzzles in OR/MS education. CE 2003: 1235-1240
1990 – 1999
- 1998
- [j10]Angie Byrne, Moshe Sniedovich, Leonid Churilov:
Handling soft constraints via composite concave programming. J. Oper. Res. Soc. 49(8): 870-877 (1998) - [j9]Leonid Churilov, Daniel Ralph, Moshe Sniedovich:
A note on composite concave quadratic programming. Oper. Res. Lett. 23(3-5): 163-169 (1998) - 1995
- [j8]Moshe Sniedovich, Suzanne Findlay:
Solving a class of multiplicative programming problems via c-programming. J. Glob. Optim. 6(3): 313-319 (1995) - 1994
- [j7]Moshe Sniedovich, Emmanuel Macalalag, Suzanne Findlay:
The simplex method as a global optimizer: A c-programming perspective. J. Glob. Optim. 4(1): 89-109 (1994) - [j6]Moshe Sniedovich:
Dynamic programming algorithms for the knapsack problem. ACM SIGAPL APL Quote Quad 24(3): 18-21 (1994) - 1993
- [j5]Moshe Sniedovich:
A dynamic programming algorithm for the traveling salesman problem. ACM SIGAPL APL Quote Quad 23(4): 1-3 (1993) - 1992
- [c3]Moshe Sniedovich, Suzanne Findlay:
Jogging with APL along the Shortest Path. APL 1992: 221-227
1980 – 1989
- 1989
- [j4]Moshe Sniedovich:
Analysis of a class of fractional programming problems. Math. Program. 43(1-3): 329-347 (1989) - 1984
- [j3]Moshe Sniedovich:
C-programming problems: a class of non-linear optimization problems. Discret. Appl. Math. 9(3): 301-305 (1984) - 1983
- [j2]Moshe Sniedovich:
A Class of Variance-Constrained Problems. Oper. Res. 31(2): 338-353 (1983) - 1982
- [c2]Moshe Sniedovich:
Interactive multilevel definition of APL functions. APL 1982: 339-345 - 1981
- [j1]Moshe Sniedovich:
Technical Note - Analysis of a Preference Order Traveling Salesman Problem. Oper. Res. 29(6): 1234-1237 (1981) - [c1]Moshe Sniedovich:
Use of APL in operations research an interactive dynamic programming model. APL 1981: 291-297
Coauthor Index
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-25 05:56 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: