Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,985,487 papers from all fields of science
Search
Sign In
Create Free Account
Exact algorithm
In computer science and operations research, exact algorithms are algorithms that always solve an optimization problem to optimality. Unless P = NP…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
APX
Algorithm
Approximation algorithm
Approximation-preserving reduction
Expand
Broader (2)
Computational complexity theory
Mathematical optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Scalable MCMC for Bayes Shrinkage Priors
J. Johndrow
,
Paulo Orenstein
2017
Corpus ID: 125711058
Gaussian scale mixture priors are frequently employed in Bayesian analysis of high-dimensional models, and a theoretical…
Expand
2015
2015
Stack pre-marshalling problem: a heuristic-guided branch-and-bound algorithm
Ruiyou Zhang
,
Zhong-Zhong Jiang
,
W. Yun
2015
Corpus ID: 54824765
The stack pre-marshalling (SPM) problem is a complex combinatorial optimization problem which arises mainly within the rapidly…
Expand
2013
2013
An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
Mariona Vilà
,
J. Pereira
European Journal of Operational Research
2013
Corpus ID: 28814512
Highly Cited
2008
Highly Cited
2008
GRASP and path relinking for project scheduling under partially renewable resources
R. Alvarez-Valdés
,
Enric Crespo
,
J. M. Tamarit
,
Fulgencia Villa
European Journal of Operational Research
2008
Corpus ID: 8922618
2006
2006
Allocation, Scheduling and Voltage Scaling on Energy Aware MPSoCs
L. Benini
,
D. Bertozzi
,
A. Guerri
,
M. Milano
Integration of AI and OR Techniques in Constraint…
2006
Corpus ID: 5570094
In this paper we introduce a complex allocation and scheduling problem for variable voltage Multi-Processor System-on-Chip (MPSoC…
Expand
Highly Cited
2000
Highly Cited
2000
Constrained two‐dimensional cutting stock problems a best‐first branch‐and‐bound algorithm
V. Cung
,
M. Hifi
,
B. L. Cun
2000
Corpus ID: 18519643
In this paper we develop a new version of the algortihm proposed in [17] for solving exactly some variants of (un)weighted…
Expand
1999
1999
The project scheduling problem with irregular starting time costs
V. Maniezzo
,
A. Mingozzi
Operations Research Letters
1999
Corpus ID: 19447808
1998
1998
Hardware-optimal test register insertion
A. P. Stroele
,
H. Wunderlich
IEEE Trans. Comput. Aided Des. Integr. Circuits…
1998
Corpus ID: 10310584
Implementing a built-in self-test by a "test per clock" scheme offers advantages concerning fault coverage, detection of delay…
Expand
1993
1993
Effects of Drying Temperature and Farina Blending on Spaghetti Quality Using Response Surface Methodology
L. Malcolmson
,
R. Matsuo
,
R. Balshaw
1993
Corpus ID: 55273525
Cereal Chem. 70(l): 1-7 Response surface methodology was used to analyze the effects of peak wavelength did not meet all of the…
Expand
1988
1988
Accuracy, Speed, and Convergence of Approximate Mean Value Analysis
J. Zahorjan
,
D. Eager
,
Hisham M. Sweillam
Performance evaluation (Print)
1988
Corpus ID: 5156419
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE