Indivisibility and divisibility polytopes.

We study thep olytopes of binary n-strings that encode (positive) integers that are not divisible by a particular positive integer p - the indivisibility polytopes, as well as the more general "clipped cubes". Also, we discuss a potential application to factoring. Finally, we present some results concerning divisibility polytopes.

MoreLess

Year of publication:	2000-04
Authors:	COPPERSMITH, Don ; LEE, Jon
Institutions:	Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain
Subject:	integer program \| polytope \| clipped cube \| totally dual integral \| ideal matrix \| generalized set covering \| binary encoding \| divisible \| factoring

More details

Extent:	application/pdf
Series:	CORE Discussion Papers.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series UNIVERSITE CATHOLIQUE DE LOUVAIN, Center for Operations Research and Econometrics (CORE) Number 2000031
Source:	RePEc - Research Papers in Economics

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