On the complexity of surrogate and group relaxation for integer linear programs

DOI10.1016/j.orl.2021.05.011OpenAlexW3169696474MaRDI QIDQ2060595

M. Hasan Mansoor, Trivikram Dokka, Adam N. Letchford

Publication date: 13 December 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2021.05.011

zbMATH Keywords

integer programmingsurrogate relaxationgroup relaxation

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Related Items (2)

Matheuristics: survey and synthesis ⋮ Revisiting surrogate relaxation for the multidimensional knapsack problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How tight is the corner relaxation? Insights gained from the stable set problem
• A trust region method for the solution of the surrogate dual in integer programming
• How tight is the corner relaxation?
• The ellipsoid method and its consequences in combinatorial optimization
• Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
• Binary clutter inequalities for integer programs
• Lagrangean relaxation. (With comments and rejoinder).
• Some polyhedra related to combinatorial problems
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Decomposition Principle for Linear Programs
• Surrogate Dual Multiplier Search Procedures in Integer Programming
• Fifty-Plus Years of Combinatorial Integer Programming
• The Group-Theoretic Approach in Mixed Integer Programming
• On the complexity of the surrogate dual of 0–1 programming
• Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
• On the existence of optimal solutions to integer and mixed-integer programming problems
• Surrogate Constraint Duality in Mathematical Programming
• Comparison of Some Algorithms for Solving the Group Theoretic Integer Programming Problem
• Reducibility among Combinatorial Problems
• On the facial structure of set packing polyhedra
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Surrogate Mathematical Programming
• Aggregating diophantine equations

This page was built for publication: On the complexity of surrogate and group relaxation for integer linear programs