2084 search results - page 273 / 417 » Set Constraints in Logic Programming |
DISOPT
2008
13 years 8 months ago
2008
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
ICASSP
2009
IEEE
14 years 3 months ago
2009
IEEE
We introduce a model for extractive meeting summarization based on the hypothesis that utterances convey bits of information, or concepts. Using keyphrases as concepts weighted by...
IPCO
2008
13 years 9 months ago
2008
Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cu...