haku: @freeterm Conflict graphs / yhteensä: 1
viite: 1 / 1
« edellinen | seuraava »
| Tekijä: | Atamtürk, A. Nemhauser, G. L. Savelsbergh, M. W. P. |
| Otsikko: | Conflict graphs in soving integer programming problems |
| Lehti: | European Journal of Operational Research
2000 : FEB, VOL. 121:1, p. 40-55 |
| Asiasana: | Operational research Integer programming Search problem |
| Vapaa asiasana: | Conflict graphs Cliques Preprocessing |
| Kieli: | eng |
| Tiivistelmä: | The article reports on the use of conflict graphs in solving integer programs. A conflict graph presents logical relations between binary variables. The authors develop algorithms and data structures that allow the effective and efficient construction, management, and use of dynamically changing conflict graphs. |
« edellinen | seuraava »
SCIMA