Showing 1 - 10 of 23
Given an undirected network G(V, E, c) and a perfect matching M <Superscript>0</Superscript>, the inverse maximum perfect matching problem is to modify the cost vector as little as possible such that the given perfect matching M <Superscript>0</Superscript> can form a maximum perfect matching. The modification can be measured by different norms. In...</superscript></superscript>
Persistent link: https://www.econbiz.de/10010994173
Persistent link: https://www.econbiz.de/10008775637
Persistent link: https://www.econbiz.de/10008925240
Persistent link: https://www.econbiz.de/10009324646
Persistent link: https://www.econbiz.de/10009324654
Persistent link: https://www.econbiz.de/10009324658
Persistent link: https://www.econbiz.de/10009324662
Persistent link: https://www.econbiz.de/10009324663
Persistent link: https://www.econbiz.de/10009324671
Persistent link: https://www.econbiz.de/10008673948