16596 search results - page 387 / 3320 » Generalized Assignment Problems |
201
click to vote
JAL
2000
15 years 7 months ago
2000
The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses....
312
click to vote
CADE
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut...
173
click to vote
GECCO
2005
Springer
16 years 29 days ago
2005
Springer
We describe a generator for hierarchical problems called the Hierarchical Problem Generator (HPG). Hierarchical problems are of interest since they constitute a class of problems ...
189
Voted
MFCS
2009
Springer
16 years 2 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
182
click to vote
TIT
2008
15 years 7 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...