default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 24 matches
- 2021
- Flavio Angelini, Katia Colaneri, Stefano Herzel, Marco Nicolosi:
Implicit incentives for fund managers with partial information. Comput. Manag. Sci. 18(4): 539-561 (2021) - Tadeusz Antczak:
A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems. Comput. Manag. Sci. 18(1): 49-71 (2021) - Massimo Arnone, Michele Leonardo Bianchi, Anna Grazia Quaranta, Gian Luca Tassinari:
Catastrophic risks and the pricing of catastrophe equity put options. Comput. Manag. Sci. 18(2): 213-237 (2021) - Luca Vincenzo Ballestra:
Enhancing finite difference approximations for double barrier options: mesh optimization and repeated Richardson extrapolation. Comput. Manag. Sci. 18(2): 239-263 (2021) - Michelle Bandarra, Vincent Guigues:
Single cut and multicut stochastic dual dynamic programming with cut selection for multistage stochastic linear programs: convergence proof and numerical experiments. Comput. Manag. Sci. 18(2): 125-148 (2021) - Amirhossein Bazargan, Salma Karray, Saeed Zolfaghari:
Can restrictions on redemption timing boost profitability of loyalty programs in competitive environments? Comput. Manag. Sci. 18(1): 99-124 (2021) - Taras Bodnar, Mathias Lindholm, Erik Thorsén, Joanna Tyrcha:
Quantile-based optimal portfolio selection. Comput. Manag. Sci. 18(3): 299-324 (2021) - Giovanni Bonaccolto:
Quantile- based portfolios: post- model- selection estimation with alternative specifications. Comput. Manag. Sci. 18(3): 355-383 (2021) - Gaetano La Bua, Daniele Marazzina:
On the application of Wishart process to the pricing of equity derivatives: the multi-asset case. Comput. Manag. Sci. 18(2): 149-176 (2021) - Songkomkrit Chaiyakan, Phantipa Thipwiwatpotjana:
Bounds on mean absolute deviation portfolios under interval-valued expected future asset returns. Comput. Manag. Sci. 18(2): 195-212 (2021) - Toly Chen:
A diversified AHP-tree approach for multiple-criteria supplier selection. Comput. Manag. Sci. 18(4): 431-453 (2021) - Tammy Drezner, Zvi Drezner, Pawel Jan Kalczynski:
Directional approach to gradual cover: the continuous case. Comput. Manag. Sci. 18(1): 25-47 (2021) - Stein-Erik Fleten, Rüdiger Schultz:
Recent advances in applied optimization under uncertainty. Comput. Manag. Sci. 18(3): 265 (2021) - Timon Gärtner, Serguei Kaniovski, Yuriy Kaniovski:
Numerical estimates of risk factors contingent on credit ratings. Comput. Manag. Sci. 18(4): 563-589 (2021) - Joseph Ryan Glover, Vinh Quan, Saeed Zolfaghari:
Some new perspectives for solving 0-1 integer programming problems using Balas method. Comput. Manag. Sci. 18(2): 177-193 (2021) - Januj Amar Juneja:
How do invariant transformations affect the calibration and optimization of the Kalman filtering algorithm used in the estimation of continuous-time affine term structure models? Comput. Manag. Sci. 18(1): 73-97 (2021) - Michal Kaut:
Scenario generation by selection from historical data. Comput. Manag. Sci. 18(3): 411-429 (2021) - Margareta Gardijan Kedzo, Bosko Sego:
The relative efficiency of option hedging strategies using the third-order stochastic dominance. Comput. Manag. Sci. 18(4): 477-504 (2021) - Yves Mbeutcha, Michel Gendreau, Grégory Emiel:
A hybrid dynamic programming - Tabu Search approach for the long-term hydropower scheduling problem. Comput. Manag. Sci. 18(3): 385-410 (2021) - Wolfgang Messner:
Empirically assessing noisy necessary conditions with activation functions. Comput. Manag. Sci. 18(1): 1-23 (2021) - Giovanni Pantuso:
A node formulation for multistage stochastic programs with endogenous uncertainty. Comput. Manag. Sci. 18(3): 325-354 (2021) - Mina Roohnavazfar, Daniele Manerba, Lohic Fotio Tiotsop, Seyed Hamid Reza Pasandideh, Roberto Tadei:
Stochastic single machine scheduling problem as a multi-stage dynamic random decision process. Comput. Manag. Sci. 18(3): 267-297 (2021) - Anna Schwele, Christos Ordoudis, Pierre Pinson, Jalal Kazempour:
Coordination of power and natural gas markets via financial instruments. Comput. Manag. Sci. 18(4): 505-538 (2021) - Addis Belete Zewde, Semu Mitiku Kassa:
Multilevel multi-leader multiple-follower games with nonseparable objectives and shared constraints. Comput. Manag. Sci. 18(4): 455-475 (2021)
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-06 18:22 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint