Pages that link to "Item:Q2547181"
From MaRDI portal
The following pages link to Transformation of integer programs to knapsack problems (Q2547181):
Displaying 34 items.
- Solving large-scale linear programs by aggregation (Q581234) (← links)
- Aggregation of nonnegative integer-valued equations (Q792220) (← links)
- A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems (Q800229) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Lattice based extended formulations for integer linear equality systems (Q847838) (← links)
- An integral transformation for integer programming problems (Q1062628) (← links)
- A duality property for the set of all feasible solutions to an integer program (Q1078071) (← links)
- On the reduction method for integer linear programs. II (Q1085786) (← links)
- Aggregation of constraints in integer programming (Q1108194) (← links)
- A result in surrogate duality for certain integer programming problems (Q1122485) (← links)
- Equivalent constraints for discrete sets (Q1135780) (← links)
- Aggregation of equations in integer programming (Q1214343) (← links)
- A necessary and sufficient condition for the aggregation of linear Diophantine equations (Q1244170) (← links)
- Representations of unbounded optimization problems as integer programs (Q1252154) (← links)
- A spectral algorithm for sequential aggregation of m linear diophantine constraints (Q1259270) (← links)
- Sequential and simultaneous aggregation of diophantine equations (Q1327205) (← links)
- Sensitivity analysis for knapsack problems: A negative result (Q1382258) (← links)
- On aggregating two linear diophantine equations (Q1383381) (← links)
- A number theoretic reformulation and decomposition method for integer programming (Q1394028) (← links)
- Solving the \(k\)-cardinality assignment problem by transformation (Q1877052) (← links)
- New results for aggregating integer-valued equations (Q1904718) (← links)
- Decomposing 1-Sperner hypergraphs (Q2315439) (← links)
- Optimal constraints aggregation method for ILP (Q2416430) (← links)
- (Q3141274) (← links)
- A note on aggregating constraints in integer programming (Q3716819) (← links)
- Calculating surrogate constraints (Q3916382) (← links)
- On Wilson's method for equivalent inequalities (Q3954743) (← links)
- Coefficient reduction for inequalities in 0–1 variables (Q4044367) (← links)
- New results on equivalent integer programming formulations (Q4058477) (← links)
- Resolution of the 0–1 knapsack problem: Comparison of methods (Q4074670) (← links)
- A method for reducing coefficients in zero‐one linear inequalities (Q4138036) (← links)
- An algorithm for the 0/1 Knapsack problem (Q4149230) (← links)
- Aggregating diophantine equations (Q5656594) (← links)
- Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach (Q5665017) (← links)
