Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints

DOI10.1080/00207160.2014.885020zbMath1309.90052OpenAlexW2063771712MaRDI QIDQ5175471

Ji-Woong Choi, In-Chan Choi

Publication date: 23 February 2015

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.885020

zbMATH Keywords

redundancylinear programknapsack constraintssurrogate constraintsfeasibility problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (1)

Three algorithms for graph locally harmonious colouring

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• The radar method: An effective line search for piecewise linear concave functions
• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
• Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
• Finding duplicate rows in a linear programming model
• A genetic algorithm for the multidimensional knapsack problem
• An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
• The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
• Advanced preprocessing techniques for linear and quadratic programming
• The multidimensional 0-1 knapsack problem: an overview.
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• Improved results on the 0--1 multidimensional knapsack problem
• On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
• The Multidimensional Knapsack Problem: Structure and Algorithms
• Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
• A heuristic approach for identification of redundant constraints in linear programming models
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• Two direct methods in linear programming

This page was built for publication: Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints