|
11 |
A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy Halman, Nir. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
12 |
Dual-Feasible Functions for Integer Programming and Combinatorial Optimization Cham : Springer International Publishing, 2016, 1st ed. 2016
|
|
|
13 |
Integer Programming and Combinatorial Optimization Cham : Springer International Publishing, 2016, 1st ed. 2016
|
|
|
14 |
Integer and Combinatorial Optimization Wolsey, Laurence A.. - New York : John Wiley & Sons, 2014, 1. Auflage
|
|
|
15 |
Integer and Combinatorial Optimization Wolsey, Laurence A.. - New York, NY : John Wiley & Sons, 2014, 1., Auflage
|
|
|
16 |
Integer Programming and Combinatorial Optimization Cham : Springer International Publishing, 2014
|
|
|
17 |
Integer programming and combinatorial optimization Berlin : Springer, 2013
|
|
|
18 |
Integer Programming and Combinatorial Optimization Berlin, Heidelberg : Springer Berlin Heidelberg, 2013
|
|
|
19 |
Integer programming and combinatorial optimization Berlin : Springer, 2011
|
|
|
20 |
Integer programming and combinatorial optimization Berlin : Springer, 2010
|
|