Coefficient reduction for inequalities in 0–1 variables
From MaRDI portal
Publication:4044367
Cites work
- scientific article; zbMATH DE number 3438384 (Why is no real title available?)
- scientific article; zbMATH DE number 3266648 (Why is no real title available?)
- scientific article; zbMATH DE number 3385535 (Why is no real title available?)
- scientific article; zbMATH DE number 3400670 (Why is no real title available?)
- Aggregating diophantine equations
- An Algorithm for Integer Linear Programming: A Combined Algebraic and Enumeration Approach
- An Approach for the Realization of Threshold Functions of Order r
- An Enumeration Algorithm for Knapsack Problems
- Equivalent Integer Programs and Canonical Problems
- Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
- Extensions of the Group Theoretic Approach in Integer Programming
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions
- The Accelerated Bound-and-Scan Algorithm for Integer Programming
- Transformation of integer programs to knapsack problems
Cited in
(22)- Applying a modified coefficient reduction method to a dynamic production scheduling model
- A spectral algorithm for sequential aggregation of m linear diophantine constraints
- Coefficient strengthening: a tool for reformulating mixed-integer programs
- Lattice based extended formulations for integer linear equality systems
- Knapsack polytopes: a survey
- On tightening cover induced inequalities
- Future paths for integer programming and links to artificial intelligence
- Strong IP formulations need large coefficients
- Generalized resolution for 0--1 linear inequalities
- Efficient reformulation for 0-1 programs -- methods and computational results
- Ordered matroids and regular independence systems
- The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Regular (2, 2)-systems
- Computing low-capacity 0–1 knapsack polytopes
- The multidimensional 0-1 knapsack problem: an overview.
- On Wilson's method for equivalent inequalities
- Polynomial-time algorithms for regular set-covering and threshold synthesis
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- A method for reducing coefficients in zero‐one linear inequalities
- Optimal constraints aggregation method for ILP
- Faces for a linear inequality in 0–1 variables
This page was built for publication: Coefficient reduction for inequalities in 0–1 variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044367)
