Coefficient reduction for inequalities in 0–1 variables
From MaRDI portal
Publication:4044367
DOI10.1007/BF01585527zbMath0292.90038OpenAlexW2000133827MaRDI QIDQ4044367
Gordon H. Bradley, Laurence A. Wolsey, Peter L. Hammer
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585527
Related Items
An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, Knapsack polytopes: a survey, Polynomial-time algorithms for regular set-covering and threshold synthesis, Lattice based extended formulations for integer linear equality systems, Coefficient strengthening: a tool for reformulating mixed-integer programs, Generalized resolution for 0--1 linear inequalities, Ordered matroids and regular independence systems, Optimal constraints aggregation method for ILP, Faces for a linear inequality in 0–1 variables, The multidimensional 0-1 knapsack problem: an overview., Applying a modified coefficient reduction method to a dynamic production scheduling model, On tightening cover induced inequalities, A method for reducing coefficients in zero‐one linear inequalities, Strong IP formulations need large coefficients, The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs, Efficient reformulation for 0-1 programs -- methods and computational results, A spectral algorithm for sequential aggregation of m linear diophantine constraints, Future paths for integer programming and links to artificial intelligence, Regular (2, 2)-systems, On Wilson's method for equivalent inequalities, Computing low-capacity 0–1 knapsack polytopes, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Transformation of integer programs to knapsack problems
- The Accelerated Bound-and-Scan Algorithm for Integer Programming
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- An Enumeration Algorithm for Knapsack Problems
- An Approach for the Realization of Threshold Functions of Order r
- Equivalent Integer Programs and Canonical Problems
- Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions
- Extensions of the Group Theoretic Approach in Integer Programming
- Aggregating diophantine equations
- Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
- An Algorithm for Integer Linear Programming: A Combined Algebraic and Enumeration Approach
