2636 search results - page 132 / 528 » Linear Programming |
IJCAI
1989
14 years 11 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...
SIAMJO
2008
14 years 10 months ago
2008
For a mathematical program with complementarity constraints (MPCC), we propose an active-set Newton method, which has the property of local quadratic convergence under the MPCC lin...
SWAT
2010
Springer
14 years 8 months ago
2010
Springer
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
IPCO
2007
14 years 11 months ago
2007
In this paper we explore the geometry of the integer points in a cone rooted at a rational point. This basic geometric object allows us to establish some links between lattice poin...
EUSFLAT
2009
14 years 7 months ago
2009
This paper deals with the competitive location problems using fuzzy sets. The basic notions on fuzzy optimization and linear programming using fuzzy sets are briefly reviewed. The ...