Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem

From MaRDI portal
Publication:2765604

DOI10.1051/ro:2001106zbMath0993.90068OpenAlexW2131390263MaRDI QIDQ2765604

Xiao-guang Yang

Publication date: 2001

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2001__35_1_117_0




Related Items (13)



Cites Work


This page was built for publication: Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem