default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartina Vandebroek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j15]Leonard Maaya, Michel Meulders
, Martina Vandebroek:
Online Consumers' Attribute Non-Attendance Behavior: Effects of Information Provision. Int. J. Electron. Commer. 24(3): 338-365 (2020)- [j14]Frits Traets, Daniel Gil Sanchez, Martina Vandebroek:
Generating Optimal Designs for Discrete Choice Experiments in R: The idefix Package. J. Stat. Softw. 96(1) (2020)
2010 – 2019
- 2017
- [j13]Nicolas Depraetere, Martina Vandebroek:
A comparison of variational approximations for fast inference in mixed logit models. Comput. Stat. 32(1): 93-125 (2017) - 2013
- [j12]Marjolein Crabbe, Bradley A. Jones, Martina Vandebroek:
Comparing Two-Stage Segmentation Methods for Choice Data with a One-Stage Latent Class Choice Analysis. Commun. Stat. Simul. Comput. 42(5): 1188-1212 (2013) - 2012
- [j11]Marjolein Crabbe, Martina Vandebroek:
Improving the efficiency of individualized designs for the mixed logit choice model by including covariates. Comput. Stat. Data Anal. 56(6): 2059-2072 (2012) - 2010
- [j10]Bart Vermeulen, Peter Goos, Martina Vandebroek:
Obtaining more information from conjoint experiments by best-worst choices. Comput. Stat. Data Anal. 54(6): 1426-1433 (2010)
2000 – 2009
- 2009
- [j9]Jie Yu, Peter Goos, Martina Vandebroek:
Efficient Conjoint Choice Designs in the Presence of Respondent Heterogeneity. Mark. Sci. 28(1): 122-135 (2009) - 2008
- [j8]Roselinde Kessels, Peter Goos, Martina Vandebroek:
Optimal designs for conjoint experiments. Comput. Stat. Data Anal. 52(5): 2369-2387 (2008) - [j7]Jie Yu, Peter Goos, Martina Vandebroek:
Model-Robust Design of Conjoint Choice Experiments. Commun. Stat. Simul. Comput. 37(8): 1603-1621 (2008) - [j6]Roselinde Kessels, Bradley A. Jones, Peter Goos, Martina Vandebroek:
Recommendations on the use of Bayesian optimal designs for choice experiments. Qual. Reliab. Eng. Int. 24(6): 737-744 (2008) - 2006
- [j5]Arvind Ruggoo, Martina Vandebroek:
Model-sensitive sequential optimal designs. Comput. Stat. Data Anal. 51(2): 1089-1099 (2006) - 2005
- [j4]Peter Goos, André Kobilinsky, Timothy E. O'Brien, Martina Vandebroek:
Model-robust and model-sensitive designs. Comput. Stat. Data Anal. 49(1): 201-216 (2005) - 2004
- [j3]Lieven Tack, Martina Vandebroek:
Trend-resistant and cost-efficient cross-over designs for mixed models. Comput. Stat. Data Anal. 46(4): 721-746 (2004) - [j2]Arvind Ruggoo, Martina Vandebroek:
Bayesian sequential D-D optimal model-robust designs. Comput. Stat. Data Anal. 47(4): 655-673 (2004) - 2003
- [j1]Peter Goos, Martina Vandebroek:
D-Optimal Split-Plot Designs With Given Numbers and Sizes of Whole Plots. Technometrics 45(3): 235-245 (2003) - 2002
- [c1]Peter Goos, Alexander N. Donev, Martina Vandebroek:
An Algorithm for the Construction of Experi-mental Designs with Fixed and Random Blocks. COMPSTAT 2002: 153-158
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-24 22:47 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:
