ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1905.07647
  4. Cited By
On greedy heuristics for computing D-efficient saturated subsets

On greedy heuristics for computing D-efficient saturated subsets

18 May 2019
Radoslav Harman
Samuel Rosa
ArXivPDFHTML

Papers citing "On greedy heuristics for computing D-efficient saturated subsets"

5 / 5 papers shown
Title
A Randomized Exchange Algorithm for Optimal Design of Multi-Response
  Experiments
A Randomized Exchange Algorithm for Optimal Design of Multi-Response Experiments
Pál Somogyi
Samuel Rosa
Radoslav Harman
13
0
0
23 Jul 2024
ForLion: A New Algorithm for D-optimal Designs under General Parametric
  Statistical Models with Mixed Factors
ForLion: A New Algorithm for D-optimal Designs under General Parametric Statistical Models with Mixed Factors
Yifei Huang
Keren Li
A. Mandal
Jie-jin Yang
13
1
0
17 Sep 2023
Mixed-integer linear programming for computing optimal experimental
  designs
Mixed-integer linear programming for computing optimal experimental designs
Radoslav Harman
Samuel Rosa
16
1
0
27 May 2023
Circuits for robust designs
Circuits for robust designs
R. Fontana
Fabio Rapallo
H. Wynn
29
2
0
21 Jun 2021
Optimal Design of Multifactor Experiments via Grid Exploration
Optimal Design of Multifactor Experiments via Grid Exploration
Radoslav Harman
Lenka Filová
Samuel Rosa
9
4
0
08 Apr 2021
1