Exact algorithm

In computer science and operations research, exact algorithms are algorithms that always solve an optimization problem to optimality. Unless P = NP… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1973-2018
05010019732018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • table 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We propose EMD-L<sub>1</sub>: a fast and exact algorithm for computing the earth mover's distance (EMD) between a pair of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Optimising routing of vehicles constitutes a major logistic stake in many industrial contexts. We are interested here in the… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
A <i>separable assignment problem</i> (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, <i>f</i… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this paper, we propose a solution procedure for the Elementary Shortest Path Problem with Resource Constraints (ESPPRC). A… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
There are two fundamental ways to view coupled systems of chemical equations: as continuous, represented by differential… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This paper shows simple dynamic programming algorithms for RNA secondary structure prediction with pseudoknots. For a basic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Motivated by the problem in computational biology of reconstructing the series of chromosome inversions by which one organism… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1994
Highly Cited
1994
  • SIAM J. NUMER, C. ELMANt
  • 1994
Variants of the Uzawa algorithm for solving symmetric indefinite linear systems are developed and analyzed. Each step of this… (More)
  • table 3
  • figure 1
  • table 4
  • table 5
Is this relevant?