146 search results - page 17 / 30 » Optimally Solving the MCM Problem Using Pseudo-Boolean Satis... |
110
click to vote
CP
1999
Springer
15 years 4 months ago
1999
Springer
In this paper we present a Lagrange-multiplier formulation of discrete constrained optimization problems, the associated discrete-space first-order necessary and sufficient condit...
94
Voted
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Automation of Web service composition is one of the most interesting challenges facing the Semantic Web today. Since Web services have been enhanced with formal semantic descriptio...
ADCM
2005
14 years 11 months ago
2005
In this paper, we study a flexible piecewise approximation technique based on the use of the idea of the partition of unity. The approximations are piecewisely defined, globally sm...
90
Voted
MP
2008
14 years 11 months ago
2008
Gomory mixed-integer (GMI) cuts generated from optimal simplex tableaus are known to be useful in solving mixed-integer programs. Further, it is well-known that GMI cuts can be de...
103
click to vote
WIOPT
2011
IEEE
14 years 3 months ago
2011
IEEE
—In this paper, we address the spectrum portfolio optimization (SPO) question in the context of secondary spectrum markets, where bandwidth (spectrum access rights) can be bought...