14 search results - page 1 / 3 » Lagrangian Relaxation and Partial Cover |
CORR
2007
Springer
13 years 10 months ago
2007
Springer
4OR
2007
13 years 11 months ago
2007
ORL
2011
13 years 5 months ago
2011
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
EOR
2008
13 years 11 months ago
2008
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
DATE
2000
IEEE
14 years 2 months ago
2000
IEEE
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...