Name
Abstract | ||
|---|---|---|
We present a new approach for exact solution of MAX-2SAT problems based on a strong reformulation deduced from an optimal continuous solution over the elementary closure of lift-and-project cuts. Computational results show that this formulation leads to a reduced number of nodes in the branch-and-bound tree and short computing times. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.orl.2005.07.001 | Oper. Res. Lett. |
Keywords | Field | DocType |
computational result,optimal continuous solution,exact solution,lift-and-project closure,reduced number,elementary closure,branch-and-bound tree,max-2sat problem,max-2sat solution,new approach,lift-and-project cut,short computing time,branch and cut,mixed integer programming,branch and bound | Exact solutions in general relativity,Lift (force),Combinatorics,Mathematical optimization,Tree (graph theory),Branch and cut,Integer programming,Branch and bound method,Mathematics | Journal |
Volume | Issue | ISSN |
34 | 4 | Operations Research Letters |
Citations | PageRank | References |
5 | 0.45 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. Bonami | 1 | 71 | 3.03 |
| Michel Minoux | 2 | 741 | 100.18 |