Sciweavers

112 search results - page 12 / 23
» Lagrangian Relaxation
Sort
View
EOR
2008
79views more  EOR 2008»
14 years 9 months ago
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
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...
Konstantinos Kaparis, Adam N. Letchford
WCE
2007
14 years 10 months ago
Statistical Aspects in Variational Principles with Heat Flow
—Applying nonequilibrium statistical mechanics we focus on nonequilibrium corrections Δs to entropy and energy of the fluid in terms of the nonequilibrium density distribution f...
Stanislaw Sieniutycz
SIAMJO
2011
14 years 4 months ago
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
Min Tao, Xiaoming Yuan
PROCEDIA
2010
67views more  PROCEDIA 2010»
14 years 7 months ago
Using the feasible set method for rezoning in ALE
One of the steps in the Arbitrary Lagrangian Eulerian (ALE) algorithm is the improvement of the quality of the computational mesh. This step, commonly referred to as rezoning, is ...
Markus Berndt, Milan Kucharik, Mikhail J. Shashkov
WAOA
2005
Springer
112views Algorithms» more  WAOA 2005»
15 years 2 months ago
Partial Multicuts in Trees
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
Asaf Levin, Danny Segev