Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
From MaRDI portal
Publication:3896842
DOI10.1287/opre.28.5.1251zbMath0449.90068OpenAlexW2153122984MaRDI QIDQ3896842
Mark H. Karwan, Ronald L. Rardin
Publication date: 1980
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.28.5.1251
multipliersLagrangianinteger linear programmingsearchabilityalternating approachcomposite surrogate dual functionsdual relaxationsmultiple surrogate dual functionssuccessful search procedures
Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05)
Related Items
On the complexity of the surrogate dual of 0–1 programming, Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, The multidimensional 0-1 knapsack problem: an overview., A relax-and-cut algorithm for the set partitioning problem, Correction to an article of Gavish and Pirkul, Workface planning in synchronous production systems, Surrogate dual method for multi-dimensional nonlinear knapsack problems, Zero duality gap in integer programming: \(P\)-norm surrogate constraint method, On the complexity of surrogate and group relaxation for integer linear programs, Calculating surrogate constraints, Distance confined path problem and separable integer programming, Zero-one integer programs with few contraints - lower bounding theory, Revisiting surrogate relaxation for the multidimensional knapsack problem, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, On generalized surrogate duality in mixed-integer nonlinear programming, The multidimensional 0-1 knapsack problem -- bounds and computational aspects, An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
