Bibliography¶
[Ande73] | L.G. Anderson: A Simulation Study of some Dynamic Channel Assignment Algorithms in a High Capacity Mobile Telecommunications System. IEEE Transactions on Communications, 21:1294–1301. 1973. |
[Appleg06] | D.L. Applegate, R.E. Bixby, V. Chvatal and W.J. Cook. The traveling salesman problem: a computational study. Princeton university press. 2006. |
[Bala75] |
|
[BCC93] | E.Balas, S. Ceria and G. Cornuéjols. A lift-and-project cutting plane algorithm for mixed 0–1 programs. Mathematical Programming, 58, 295-324, 1993. |
[BeFo76] |
|
[BeTo70] |
|
[Capr96] |
|
[Dantz54] |
|
[DHL17I] |
|
[FGL05] |
|
[Fisch14] |
|
[Gomo69] | R.E. Gomory. Some polyhedra related to combinatorial problems. Linear Algebra and its Applications, 2(4):451-558, 1969. |
[Junge09] |
|
[Kan60] |
|
[LMM02] |
|
[Mann60] | A.S. Manne. On the job-shop scheduling problem. Operations Research, 8(2):219–223, 1960. |
[Marc01] |
|
[Padb73] | M.W. Padberg. On the facial structure of set packing polyhedra. Mathematical Programming, 5, 199-215, 1973. |
[PWW69] |
|
[Wols98] | Wolsey, L.A. Integer Programming. Wiley-Interscience. 1998. |