Polynomial bounding for NP-hard problems

DOI10.1007/BFB0120890MaRDI QIDQ3879041zbMATH OpenOpenAlexFDO

Authors Francesco Maffioli, Paolo M. Camerini

Publication date 1980

Published in Mathematical Programming Studies (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial optimizationcomputation of lower boundsgeneral transportation problemheuristicsNP-hard problemspolynomial algorithmpolynomial bounded methodrelaxation of side constraintssuboptimal solutions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

This page was built for publication: Polynomial bounding for NP-hard problems

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