default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Branda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Martin Branda, Monika Matousková
:
A Lagrangian relaxation algorithm for stochastic fixed interval scheduling problem with non-identical machines and job classes. Comput. Oper. Res. 164: 106542 (2024)- 2020
- [j20]Lukás Adam, Martin Branda, Holger Heitsch, René Henrion:
Solving joint chance constrained problems using regularization and Benders' decomposition. Ann. Oper. Res. 292(2): 683-709 (2020)
2010 – 2019
- 2018
- [j19]Martin Branda, Max Bucher, Michal Cervinka, Alexandra Schwartz:
Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization. Comput. Optim. Appl. 70(2): 503-530 (2018) - [j18]Martin Branda:
Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times. Comput. Oper. Res. 98: 231-239 (2018) - 2017
- [j17]Martin Branda, Stepán Hájek:
Flow-based formulations for operational fixed interval scheduling problems with random delays. Comput. Manag. Sci. 14(1): 161-177 (2017) - 2016
- [j16]Martin Branda:
Mean-value at risk portfolio efficiency: approaches based on data envelopment analysis models with negative data and their empirical behaviour. 4OR 14(1): 77-99 (2016) - [j15]Martin Branda, Jan Novotný, Asmund Olstad:
Fixed interval scheduling under uncertainty - A tabu search algorithm for an extended robust coloring formulation. Comput. Ind. Eng. 93: 45-54 (2016) - [j14]Lukás Adam, Martin Branda:
Sparse optimization for inverse problems in atmospheric modelling. Environ. Model. Softw. 79: 256-266 (2016) - [j13]Lukás Adam, Martin Branda:
Nonlinear Chance Constrained Problems: Optimality Conditions, Regularization and Solvers. J. Optim. Theory Appl. 170(2): 419-436 (2016) - [j12]Martin Branda, Milos Kopa:
DEA models equivalent to general Nth order stochastic dominance efficiency tests. Oper. Res. Lett. 44(2): 285-289 (2016) - 2014
- [j11]Martin Branda:
Optimization Approaches to Multiplicative Tariff of Rates Estimation in Non-Life Insurance. Asia Pac. J. Oper. Res. 31(5) (2014) - [j10]Martin Branda, Milos Kopa:
On relations between DEA-risk models and stochastic dominance efficiency tests. Central Eur. J. Oper. Res. 22(1): 13-35 (2014) - [j9]Martin Branda:
Exact Penalization in Stochastic Programming - Calmness and Constraint Qualification. Adv. Decis. Sci. 2014: 569458:1-569458:6 (2014) - [j8]Martin Branda:
Sample approximation technique for mixed-integer stochastic programming problems with expected value constraints. Optim. Lett. 8(3): 861-875 (2014) - 2013
- [j7]Martin Branda:
Diversification-consistent data envelopment analysis with general deviation measures. Eur. J. Oper. Res. 226(3): 626-635 (2013) - [j6]Martin Branda:
On relations between chance constrained and penalty function problems under discrete distributions. Math. Methods Oper. Res. 77(2): 265-277 (2013) - [j5]Martin Branda:
Reformulations of input-output oriented DEA tests with diversification. Oper. Res. Lett. 41(5): 516-520 (2013) - 2012
- [j4]Martin Branda, Jitka Dupacová:
Approximation and contamination bounds for probabilistic programs. Ann. Oper. Res. 193(1): 3-19 (2012) - [j3]Martin Branda:
Chance constrained problems: penalty reformulation and performance of sample approximation technique. Kybernetika 48(1): 105-122 (2012) - [j2]Martin Branda:
Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints. Oper. Res. Lett. 40(3): 207-211 (2012) - 2010
- [j1]Martin Branda:
Local stability and differentiability of the Mean-Conditional Value at Risk model defined on the mixed-integer loss functions. Kybernetika 46(3): 362-373 (2010)
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-08-03 21:10 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:
