1064 search results - page 2 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
SIBGRAPI
2005
IEEE
13 years 10 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
EOR
2007
13 years 5 months ago
2007
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This ...
SSPR
2010
Springer
13 years 3 months ago
2010
Springer
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
RTA
2000
Springer
13 years 8 months ago
2000
Springer
We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...