Sciweavers

14739 search results - page 146 / 2948
» An optimization problem on the sphere
Sort
View
SSWMC
2004
14 years 12 months ago
On the complexity and hardness of the steganography embedding problem
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
Rajarathnam Chandramouli, Shalin P. Trivedi, R. N....
LION
2010
Springer
307views Optimization» more  LION 2010»
15 years 3 months ago
A Column Generation Heuristic for the General Vehicle Routing Problem
This paper presents a column generation heuristic for the general vehicle routing problem (GVRP), a combined load acceptance and rich vehicle routing problem incorporating various ...
Asvin Goel
DISOPT
2007
90views more  DISOPT 2007»
14 years 10 months ago
On the job rotation problem
The job rotation problem (JRP) is the following: Given an n × n matrix A over R ∪ {−∞} and k ≤ n, find a k × k principal submatrix of A whose optimal assignment problem...
Peter Butkovic, Seth Lewis
HEURISTICS
2002
81views more  HEURISTICS 2002»
14 years 10 months ago
Heuristics for the Phylogeny Problem
In view of the strong increasing number of phylogeny problems and instances, the assessment of the respective optimization algorithms has become harder too. This paper contributes ...
Alexandre A. Andreatta, Celso C. Ribeiro
EOR
2008
85views more  EOR 2008»
14 years 10 months ago
The Linear Ordering Problem with cumulative costs
Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory t...
Livio Bertacco, Lorenzo Brunetta, Matteo Fischetti