Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
From MaRDI portal
Publication:1366300
DOI10.1023/A:1008621204567zbMath0886.90103MaRDI QIDQ1366300
Fred Glover, Hanif D. Sherali, Youngho Lee
Publication date: 23 October 1997
Published in: Computational Optimization and Applications (Search for Journal in Brave)
surrogate constraint analysisstrong valid inequalitiesfractional surrogate constraint cutsseparation proceduresurrogate-knapsack
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Boolean programming (90C09)
Related Items
Knapsack polytopes: a survey, Surrogate-RLT cuts for zero-one integer programs, A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement, Foundation-penalty cuts for mixed-integer programs., Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design, Second-order cover inequalities, Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes, A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities, Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem, Partial convexification cuts for 0--1 mixed-integer programs, Chvatal--Gomory--tier cuts for general integer programs, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Uses Software
