Sciweavers

1723 search results - page 31 / 345
» Cycling in linear programming problems
Sort
View
MP
2008
137views more  MP 2008»
15 years 2 months ago
Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints
Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into...
Nilay Noyan, Andrzej Ruszczynski
FUIN
2010
93views more  FUIN 2010»
15 years 1 months ago
SAT as a Programming Environment for Linear Algebra
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
Marian Srebrny, Lidia Stepien
EUROGP
2001
Springer
106views Optimization» more  EUROGP 2001»
15 years 7 months ago
Linear-Tree GP and Its Comparison with Other GP Structures
Abstract. In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graph stru...
Wolfgang Kantschik, Wolfgang Banzhaf
CORR
2010
Springer
142views Education» more  CORR 2010»
15 years 2 months ago
Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack
Recent years have seen an explosion of interest in lift and project methods, such as those proposed by Lov
Anna R. Karlin, Claire Mathieu, C. Thach Nguyen
FOCS
2005
IEEE
15 years 8 months ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy