Equivalent constraints for discrete sets
From MaRDI portal
Publication:1135780
DOI10.1016/0166-218X(79)90013-1zbMath0425.90087OpenAlexW2089941233MaRDI QIDQ1135780
Publication date: 1979
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(79)90013-1
discrete setscomputational techniquessimplyfying constraintsstability properties of integer programs
Numerical mathematical programming methods (65K05) Integer programming (90C10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Mathematical programming (90C99)
Cites Work
- Unnamed Item
- Unnamed Item
- Strong duality for a special class of integer programs
- Transformation of integer programs to knapsack problems
- On the Polyhedrality of the Convex Hull of the Feasible Set of an Integer Program
- Aggregating diophantine equations
- Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
- Technical Note—Rationalizing Discrete Programs
This page was built for publication: Equivalent constraints for discrete sets