2976 search results - page 117 / 596 » On the bounded integer programming |
101
click to vote
ORL
2011
14 years 7 months ago
2011
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to small set covering instances that provide a computational challenge for integer programming ...
CORR
2010
Springer
15 years 21 days ago
2010
Springer
We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.
109
Voted
ICALP
1992
Springer
15 years 4 months ago
1992
Springer
Real-time systems operate in \real," continuous time and state changes may occur at any real-numbered time point. Yet many veri cation methods are based on the assumption that...
104
Voted
MP
2006
15 years 16 days ago
2006
This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated lot-sizing problem under uncertainty. We show that the classical ( , S) inequalit...
78
Voted
ICALP
1999
Springer
15 years 4 months ago
1999
Springer
We describe exact algorithms that provide new upper bounds for the Maximum Satisfiability problem (MaxSat). We prove