-
1
-
-
62249219958
-
-
PhD thesis, Technische Universität Berlin; Fakultät II - Mathematik und Naturwissenschaften. Institut für Mathematik
-
Achterberg, T.: Constraint Integer Programming. PhD thesis, Technische Universität Berlin; Fakultät II - Mathematik und Naturwissenschaften. Institut für Mathematik (2007)
-
(2007)
Constraint Integer Programming
-
-
Achterberg, T.1
-
2
-
-
0001878760
-
Gomory cuts revisited
-
Balas, E., Ceria, S., Cornuéjols, G., Natraj, N.: Gomory cuts revisited. Operations Research Letters 19, 1-9 (1996)
-
(1996)
Operations Research Letters
, vol.19
, pp. 1-9
-
-
Balas, E.1
Ceria, S.2
Cornuéjols, G.3
Natraj, N.4
-
3
-
-
0001851118
-
Experiments in mixed integer linear programming
-
Bénichou, M., Gauthier, J.M., Girodet, P., Hentges, G., Ribière, G., Vincent, O.: Experiments in mixed integer linear programming. Mathematical Programming 1, 76-94 (1971)
-
(1971)
Mathematical Programming
, vol.1
, pp. 76-94
-
-
Bénichou, M.1
Gauthier, J.M.2
Girodet, P.3
Hentges, G.4
Ribière, G.5
Vincent, O.6
-
5
-
-
69849086850
-
Backdoors to Combinatorial Optimization: Feasibility and Optimality
-
van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. Springer, Heidelberg
-
Dilkina, B., Gomes, C.P., Malitsky, Y., Sabharwal, A., Sellmann, M.: Backdoors to Combinatorial Optimization: Feasibility and Optimality. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 56-70. Springer, Heidelberg (2009)
-
(2009)
LNCS
, vol.5547
, pp. 56-70
-
-
Dilkina, B.1
Gomes, C.P.2
Malitsky, Y.3
Sabharwal, A.4
Sellmann, M.5
-
6
-
-
77955439789
-
Information-based branching schemes for binary linear mixed integer problems
-
Karzan, F.K., Nemhauser, G.L., Savelsbergh, M.W.P.: Information-based branching schemes for binary linear mixed integer problems. Mathematical Programming Computation 1, 249-293 (2009)
-
(2009)
Mathematical Programming Computation
, vol.1
, pp. 249-293
-
-
Karzan, F.K.1
Nemhauser, G.L.2
Savelsbergh, M.W.P.3
-
7
-
-
79960020368
-
-
Preliminary version
-
MIPLIB 2010. Preliminary version, http://miplib.zip.de/
-
MIPLIB 2010
-
-
-
8
-
-
84880764589
-
Backdoors to typical case complexity
-
Gottlob, G., Walsh, T. (eds.) Morgan Kaufmann, San Francisco
-
Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: Gottlob, G., Walsh, T. (eds.) IJCAI 2003: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pp. 1173-1178. Morgan Kaufmann, San Francisco (2003)
-
(2003)
IJCAI 2003: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence
, pp. 1173-1178
-
-
Williams, R.1
Gomes, C.P.2
Selman, B.3
|