Asymptotic strong determination in integer programming: Quasi dual method

DOI10.1007/s001860200238zbMath1023.90042OpenAlexW2084637284MaRDI QIDQ1395370

Yi-Fan Xu

Publication date: 26 June 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860200238

zbMATH Keywords

integer programmingLagrangian relaxationquasi dual formulation

Mathematics Subject Classification ID

Integer programming (90C10) Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

Multiple cost coefficients sensitivity theorems of integer linear optimization

This page was built for publication: Asymptotic strong determination in integer programming: Quasi dual method