1707 search results - page 55 / 342 » Early Integer Programming |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime inte...
64
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
IPCO
2010
14 years 11 months ago
2010
This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tab...
IPCO
2008
14 years 11 months ago
2008
We consider the positive semidefinite (psd) matrices with binary entries. We give a characterisation of such matrices, along with a graphical representation. We then move on to co...
ORL
2008
14 years 9 months ago
2008
A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in...