Discrete Optimization

Paper

01 Sep 2005

Parsimonious binary-encoding in integer programming

View publication

Abstract

We describe an effective method for doing binary-encoded modeling, in the context of 0/1 linear programming, when the number of feasible configurations is not a power of two. Our motivation comes from modeling all-different restrictions. © 2005 Elsevier B.V. All rights reserved.

Related

Paper

Effective generation of compressed stationary Gaussian fields

Robert Manson Sawko, Malgorzata Zimon

SIAM/ASA JUQ

Paper

On the spectral radius of (0,1)-matrices

R.A. Brualdi, A.J. Hoffman

Linear Algebra and Its Applications

Paper

Adaptive solution strategy for solving large systems of p‐type finite element equations

R.B. Morris, Y. Tsuji, et al.

International Journal for Numerical Methods in Engineering

Paper

Multiparameter parallel search branch switching

Michael E. Henderson

International Journal of Bifurcation and Chaos in Applied Sciences and Engineering

View all publications