3250 search results - page 15 / 650 » An Algorithm to Solve a Linear Program |
IOR
2002
13 years 8 months ago
2002
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
TSMC
2010
13 years 3 months ago
2010
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...
JMLR
2006
13 years 8 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
SIAMJO
2002
13 years 8 months ago
2002
A linear program has a unique least 2-norm solution provided that the linear program has a solution. To locate this solution, most of the existing methods were devised to solve cer...