On the complexity of surrogate and group relaxation for integer linear programs
type: Item
instance of: scholarly article
title: On the complexity of surrogate and group relaxation for integer linear programs
author: Trivikram Dokka
author: Adam N. Letchford
author: M. Hasan Mansoor
published in: Operations Research Letters
publication date: 2021-12-13T00:00:00Z
Mathematics Subject Classification ID: 90-XX
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7443055
zbMATH Keywords: integer programming
zbMATH Keywords: surrogate relaxation
zbMATH Keywords: group relaxation
MaRDI profile type: Publication
full work available at URL: j.orl.2021.05.011
OpenAlex ID: W3169696474
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Q3241581
cites work: A trust region method for the solution of the surrogate dual in integer programming
cites work: On the complexity of the surrogate dual of 0–1 programming
cites work: Comparison of Some Algorithms for Solving the Group Theoretic Integer Programming Problem
cites work: Fifty-Plus Years of Combinatorial Integer Programming
cites work: How tight is the corner relaxation? Insights gained from the stable set problem
cites work: Decomposition Principle for Linear Programs
cites work: How tight is the corner relaxation?
cites work: Q4198056
cites work: Q4178782
cites work: Surrogate Constraint Duality in Mathematical Programming
cites work: Aggregating diophantine equations
cites work: ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
cites work: Some polyhedra related to combinatorial problems
cites work: Surrogate Mathematical Programming
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Lagrangean relaxation. (With comments and rejoinder).
cites work: Reducibility among Combinatorial Problems
cites work: Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
cites work: Surrogate Dual Multiplier Search Procedures in Integer Programming
cites work: Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
cites work: Binary clutter inequalities for integer programs
cites work: On the existence of optimal solutions to integer and mixed-integer programming problems
cites work: On the facial structure of set packing polyhedra
cites work: The Group-Theoretic Approach in Mixed Integer Programming
cites work: Q3804448
cites work: Q3818127
DOI: 10.1016/J.ORL.2021.05.011
description: scientific article; zbMATH DE number 7443055