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

DOI10.1016/J.ORL.2021.05.011MaRDI QIDQ2060595zbMATH OpenOpenAlexFDO

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

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

group relaxationinteger programmingsurrogate relaxation

Mathematics Subject Classification ID

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

Recommendations

• On the complexity of the surrogate dual of 0–1 programming
• scientific article; zbMATH DE number 4039640
• Alternative group relaxation of integer programming problems
• scientific article; zbMATH DE number 3934777
• Surrogate duality in a branch-and-bound procedure for integer programming

Cites work

• A trust region method for the solution of the surrogate dual in integer programming
• Aggregating diophantine equations
• Binary clutter inequalities for integer programs
• Branch-and-price: Column generation for solving huge integer programs
• Comparison of Some Algorithms for Solving the Group Theoretic Integer Programming Problem
• Decomposition Principle for Linear Programs
• Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
• Fifty-plus years of combinatorial integer programming
• How tight is the corner relaxation?
• How tight is the corner relaxation? Insights gained from the stable set problem
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 4072712 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Lagrangean relaxation. (With comments and rejoinder).
• On the complexity of the surrogate dual of 0–1 programming
• On the existence of optimal solutions to integer and mixed-integer programming problems
• On the facial structure of set packing polyhedra
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Reducibility among combinatorial problems
• Some polyhedra related to combinatorial problems
• Surrogate Constraint Duality in Mathematical Programming
• Surrogate Dual Multiplier Search Procedures in Integer Programming
• Surrogate Mathematical Programming
• Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
• The ellipsoid method and its consequences in combinatorial optimization
• The group-theoretic approach in mixed integer programming

Cited in

(4)

• Standard pairs and group relaxations in integer programming
• Revisiting surrogate relaxation for the multidimensional knapsack problem
• Matheuristics: survey and synthesis
• Contemporary approaches in matheuristics an updated survey

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2060595)