Equivalent constraints for discrete sets (Q1135780): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Transformation of integer programs to knapsack problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Aggregating diophantine equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Technical Note—Rationalizing Discrete Programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5339894 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5538300 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Strong duality for a special class of integer programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Polyhedrality of the Convex Hull of the Feasible Set of an Integer Program / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach / rank | |||
Normal rank |
Revision as of 04:09, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Equivalent constraints for discrete sets |
scientific article |
Statements
Equivalent constraints for discrete sets (English)
0 references
1979
0 references
discrete sets
0 references
stability properties of integer programs
0 references
computational techniques
0 references
simplyfying constraints
0 references