The UvA-LINKER will give you a range of other options to find the full text of a publication (including a direct link to the full-text if it is located on another database on the internet).
De UvA-LINKER biedt mogelijkheden om een publicatie elders te vinden (inclusief een directe link naar de publicatie online als deze beschikbaar is in een database op het internet).
faculty: "FEB" and publication year: "2006"
| Authors||C.W. Duin, A. Volgenant|
|Title||Some inverse optimization problems under the Hamming distance|
|Journal||European Journal of Operational Research|
|Faculty||Faculty of Economics and Business|
|Institute/dept.||FEB: Research Institute in Economics and Econometrics Amsterdam (RESAM)|
|Abstract||Given a feasible solution to a particular combinatorial optimization problem defined on a graph and a cost vector defined on the arcs of the graph, the corresponding inverse problem is to disturb the cost vector such that the feasible solution becomes optimal. The aim is to optimize the difference between the initial cost vector and the disturbed one. This difference can be measured in several ways. We consider the Hamming distance measuring in how many components two vectors are different, where weights are associated to the components. General algorithms for the bottleneck or minimax criterion are described and (after modification) applied to the inverse minimum spanning tree problem, the inverse shortest path tree problem and the linear assignment problem.
Keywords: Combinatorial optimization; Inverse optimization; Minimum spanning tree; Shortest path; Linear assignment|
Use this url to link to this page: http://dare.uva.nl/en/record/226397
Contact us about this recordNotify a colleague
Add to bookbag