Search Results - subject:"Integer Programming"

The Generalized Basis Reduction Algorithm

Scarf, Herbert E.; Lovasz, Laszlo - Cowles Foundation for Research in Economics, Yale University - 1990

respect to F and relate the basis vectors b^{i} to Minkowski's successive minima. The results lead to an algorithm for integer … programming which executes in polynomial time for fixed n, but which avoids the ellipsoidal approximation required by Lenstra …

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

Transformation of two-dimensional unconstrained cutting problems into a set of one-dimensional knapsack problems

Wilt, Ann van der - 1990

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

Some envelope theorems for integer and discrete choice variables

Sah, Raaj Kumar; Zhao, Jingang - 1990

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

Tour scheduling and task assignment of a heterogeneous work force : a heuristic approach

Loucks, John S.; Jacobs, F. Robert - 1990

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

Mathematical Programming and Economic Theory

Scarf, Herbert E. - Cowles Foundation for Research in Economics, Yale University - 1989

large firm is offered for Lenstra's integer programming algorithm. …

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

Neighbors of the Origin for Four by Three Matrices

Shallcross, David F. - Cowles Foundation for Research in Economics, Yale University - 1989

Scarf has defined a neighborhood system for families of integer programs where the right-hand side is allowed to vary. This system depends on a matrix A of constraint and objective function coefficients of the integer programs. This paper characterizes the set of neighbors of the origin when A...

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

Compact integer-programming models for extracting subsets of stimuli from confusion matrices

Brusco, Michael; Stahl, Stephanie - In: Psychometrika 66 (2001) 3, pp. 405-419

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

Optimal volume subintervals with k points and star discrepancy via integer programming

Thiémard, Eric - In: Computational Statistics 54 (2001) 1, pp. 21-45

volume that contains exactly k of the n points. We give integer programming formulations of these problems and techniques to …

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

Classical cuts for mixed-integer programming and branch-and-cut

Padberg, Manfred - In: Computational Statistics 53 (2001) 2, pp. 173-203

We review classical valid linear inequalities for mixed-integer programming, i.e., Gomory's fractional and mixed …

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

Optimal volume subintervals with k points and star discrepancy via integer programming

Thiémard, Eric - In: Mathematical Methods of Operations Research 54 (2001) 1, pp. 21-45

volume that contains exactly k of the n points. We give integer programming formulations of these problems and techniques to …

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