Results 241 to 250 of about 970,483 (277)
Some of the next articles are maybe not open access.
SIAM Journal on Discrete Mathematics, 1991
For each value of the parameters $A,n,d$, a linear program exists whose integer solutions correspond to codes. The Plotkin bound gives a necessary and sufficient condition on $n/d$ for feasibility. Some further simple remarks on the tableau of the linear program can be made; it can also be modified to consider only linear codes.
openaire +1 more source
For each value of the parameters $A,n,d$, a linear program exists whose integer solutions correspond to codes. The Plotkin bound gives a necessary and sufficient condition on $n/d$ for feasibility. Some further simple remarks on the tableau of the linear program can be made; it can also be modified to consider only linear codes.
openaire +1 more source
Elementary closures for integer programs
Operations Research Letters, 2001In integer programming, the elementary closure associated with a family of cuts is the convex set defined by the intersection of all the cuts in the family. In this paper, we compare the elementary closures arising from several classical families of cuts: three versions of Gomory's fractional cuts, three versions of Gomory's mixed integer cuts, two ...
Gérard Cornuéjols, Yanjun Li
openaire +2 more sources
On the complexity of integer programming
Journal of the ACM, 1981A simple proof that integer programming ts in X~ ~s given. The proof also estabhshes that there ~s a pseudopolynomial-tune algorithm for integer programmmg with any (fixed) number of constraints.
openaire +2 more sources
Communications of the ACM
A new analysis proves that all integer programs theoretically could be solved much faster than previously guaranteed.
openaire +1 more source
A new analysis proves that all integer programs theoretically could be solved much faster than previously guaranteed.
openaire +1 more source
A Method of Decomposition for Integer Programs
Operations Research, 1979A method of decomposing integer programs with block angular structure is presented. It is based on the notion of searching for the optimal solution to an integer program among the near-optimal solutions to its Lagrangian relaxation. An optimality theorem is obtained and a generic decomposition algorithm is presented. An application of this approach is
Dennis J. Sweeney, Richard A. Murphy
openaire +1 more source
Integer programming in forestry
Annals of Operations Research, 2006After finishing my Ph.D. in Berkeley in 1971, I needed a job in the San Francisco Bay Area, while my wife was finishing her Ph.D. in statistics. It was a tough year jobwise and the only available position was a part-time job with the US Forest Service Station in Berkeley, which funded a position as a Research Engineer at the OR Center at UC Berkeley ...
openaire +3 more sources
Stochastic Integer Programming.
1997no abstract.
Stougie, L., van der Vlerk, M.H.
openaire +4 more sources
On Tensor Powers of Integer Programs
SIAM Journal on Discrete Mathematics, 1992Summary: A natural product on integer programming problems with nonnegative coefficients is defined. Hypergraph covering problems are a special case of such integer programs, and the product defined is a generalization of the usual hypergraph product.
Robin Pemantle +2 more
openaire +1 more source
Integer and Mixed-Integer Programming
1997We survey techniques for sensitivity analysis of integer programming and related problems. The emphasis is on finding analogues from linear programming.
openaire +1 more source