1723 search results - page 38 / 345 » Cycling in linear programming problems |
128
click to vote
DAGSTUHL
2006
15 years 3 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
128
click to vote
SIAMJO
2002
15 years 2 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...
117
Voted
ESOP
2008
Springer
15 years 4 months ago
2008
Springer
We present a static analysis for inferring the maximum amount of buffer space used by a program consisting of concurrently running processes communicating via buffered channels. We...
133
Voted
IJCAI
1989
15 years 3 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
115
click to vote
INFORMATICALT
2000
15 years 2 months ago
2000
It is well known that in linear programming, the optimal values of the dual variables can be interpreted as shadow prices (marginal values) of the right-hand side coefficients. How...