How difficult is the frequency selection problem?
type: Item
instance of: scholarly article
title: How difficult is the frequency selection problem?
zbMATH Open document ID: 0843.90132
DOI: 10.1016/0167-6377(95)00004-4
published in: Operations Research Letters
publication date: 1996-01-16T00:00:00Z
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 834653
zbMATH Keywords: simulation
zbMATH Keywords: frequency domain methodology
zbMATH Keywords: frequency selection problem
zbMATH Keywords: indicator function spacing problem
zbMATH Keywords: discrete-event simulations
zbMATH Keywords: NP-complete problem
author: Sheldon H. Jacobson
MaRDI profile type: Publication
full work available at URL: 0167-6377(95)00004-4
OpenAlex ID: W1966457248
cites work: Q4198056
cites work: Driving Frequency Selection for Frequency Domain Simulation Experiments
cites work: How easy is local search?
cites work: A new polynomial-time algorithm for linear programming
cites work: Simulation Factor Screening Using Harmonic Analysis
cites work: Q3323077
cites work: Design of frequency-domain experiments for discrete-valued factors
cites work: Hill Climbing with Multiple Local Optima
cites work: Q3975934
Recommended article: On the problem of frequencies separation
Recommended article: Q3018219
Recommended article: Computing Frequency Dominators and Related Problems
Recommended article: Frequency assignment problem in networks with limited spectrum
Recommended article: Q5416140
Recommended article: Q5490341
Recommended article: SHOULD WE ESTIMATE THE PROBABILITY OF CORRECT SELECTION?
description: scientific article; zbMATH DE number 834653