12519 search results - page 412 / 2504 » Approximation Problems Categories |
166
click to vote
APPROX
2004
Springer
16 years 7 days ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
170
click to vote
ISMIR
2004
Springer
16 years 5 days ago
2004
Springer
We consider the music pattern matching problem—to find occurrences of a small fragment of music called the “pattern” in a larger body of music called the “score”—as a...
182
click to vote
CEC
2010
IEEE
15 years 8 months ago
2010
IEEE
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Prob...
167
click to vote
COR
2006
15 years 6 months ago
2006
This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered....
212
click to vote
EOR
2007
15 years 6 months ago
2007
In this paper, we study different strategies to stabilize and accelerate the column generation method, when it is applied specifically to the variable sized bin-packing problem,...