Pages that link to "Item:Q4044367"

The following pages link to Coefficient reduction for inequalities in 0–1 variables (Q4044367):

Displaying 22 items.

• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• Lattice based extended formulations for integer linear equality systems (Q847838) (← links)
• Coefficient strengthening: a tool for reformulating mixed-integer programs (Q847848) (← links)
• Polynomial-time algorithms for regular set-covering and threshold synthesis (Q1089348) (← links)
• Applying a modified coefficient reduction method to a dynamic production scheduling model (Q1197923) (← links)
• On tightening cover induced inequalities (Q1199516) (← links)
• The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs (Q1237653) (← links)
• A spectral algorithm for sequential aggregation of m linear diophantine constraints (Q1259270) (← links)
• An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
• Generalized resolution for 0--1 linear inequalities (Q1354004) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672) (← links)
• Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
• Ordered matroids and regular independence systems (Q1918556) (← links)
• Strong IP formulations need large coefficients (Q2019425) (← links)
• Optimal constraints aggregation method for ILP (Q2416430) (← links)
• On Wilson's method for equivalent inequalities (Q3954743) (← links)
• Computing low-capacity 0–1 knapsack polytopes (Q3958269) (← links)
• Faces for a linear inequality in 0–1 variables (Q4074671) (← links)
• A method for reducing coefficients in zero‐one linear inequalities (Q4138036) (← links)
• Regular (2, 2)-systems (Q4740583) (← links)