Name
Abstract | ||
|---|---|---|
We study two techniques to obtain new families of classical and general Dual-Feasible Functions: a conversion from minimal Gomory–Johnson functions; and computer-based search using polyhedral computation and an automatic maximality and extremality test. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.endm.2017.10.027 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
integer programming,cutting planes,cut-generating functions,Dual-Feasible Functions,2-slope theorem,computer-based search | Discrete mathematics,Combinatorics,Mathematics,Computation | Journal |
Volume | ISSN | Citations |
62 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthias KöPpe | 1 | 191 | 20.95 |
| jiawei wang | 2 | 37 | 11.22 |