Similar Search Results

A note on the Martello-Toth algorithm for one-dimensional knapsack problems

Aittoniemi, Leena; Oehlandt, Klaus - In: European Journal of Operational Research 20 (1985) 1, pp. 117-116

Persistent link: https://www.econbiz.de/10005239947

On the efficient use of the architecture of a small computer for LP algorithms

Ahonen, Hannu; Aittoniemi, Leena; Apiola, Heikki; … - In: European Journal of Operational Research 24 (1986) 1, pp. 4-11

Persistent link: https://www.econbiz.de/10005283267

MOPS -- Mathematical optimization system

Suhl, Uwe H. - In: European Journal of Operational Research 72 (1994) 2, pp. 312-322

Persistent link: https://www.econbiz.de/10005277575

Pivot-and-reduce cuts: An approach for improving Gomory mixed-integer cuts

Wesselmann, Franz; Koberstein, Achim; Suhl, Uwe H. - In: European Journal of Operational Research 214 (2011) 1, pp. 15-26

Gomory mixed-integer cuts are of crucial importance in solving large-scale mixed-integer linear programs. Recently, there has been considerable research particularly on the strengthening of these cuts. We present a new heuristic algorithm which aims at improving Gomory mixed-integer cuts. Our...

Persistent link: https://www.econbiz.de/10009146058

Pivot-and-reduce cuts: An approach for improving Gomory mixed-integer cuts

Wesselmann, Franz; Koberstein, Achim; Suhl, Uwe H. - In: European journal of operational research : EJOR 214 (2011) 1, pp. 15-27

Persistent link: https://www.econbiz.de/10009133510

Solving 0-1 integer programming problems arising from large scale planning models

Johnson, Ellis L.; Kostreva, Michael M.; Suhl, Uwe H. - In: Operations research 33 (1985) 4, pp. 803-819

Persistent link: https://www.econbiz.de/10003590894