Pages that link to "Item:Q5665017"
From MaRDI portal
The following pages link to Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach (Q5665017):
Displayed 18 items.
- Aggregation of nonnegative integer-valued equations (Q792220) (← links)
- Lattice based extended formulations for integer linear equality systems (Q847838) (← 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)
- An analytical comparison of different formulations of the travelling salesman problem (Q1181739) (← links)
- Aggregation of equations in integer programming (Q1214343) (← 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)
- An analog of the Cook theorem for polytopes (Q1759309) (← links)
- New results for aggregating integer-valued equations (Q1904718) (← links)
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation (Q2259297) (← links)
- Decomposing 1-Sperner hypergraphs (Q2315439) (← links)
- Coefficient reduction for inequalities in 0–1 variables (Q4044367) (← links)
- New results on equivalent integer programming formulations (Q4058477) (← links)