English, Article edition: A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE LONGCHENG LIU; ENYU YAO

User activity

Share to:
 
Bookmark: http://trove.nla.gov.au/version/131411
Physical Description
  • article
Language
  • English

Edition details

Title
  • A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
Author
  • LONGCHENG LIU
  • ENYU YAO
Physical Description
  • article
Notes
  • An inverse optimization problem is defined as follows. Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost (capacity) vector, and x0 â S. We want to perturb the cost (capacity) vector c to d so that x0 is an optimal solution of P with respect to the cost (capacity) vector d, and to minimize some objective function. In this paper, we consider the weighted inverse minimum cut problem under the bottleneck type Hamming distance. For the general case, we present a combinatorial algorithm that runs in strongly polynomial time.
  • Minimum cut, inverse problem, hamming distance, strongly polynomial algorithm
  • RePEc:wsi:apjorx:v:24:y:2007:i:05:p:725-736
Language
  • English
Contributed by
OAIster

Get this edition

  • Set up My libraries

    How do I set up "My libraries"?

    In order to set up a list of libraries that you have access to, you must first login or sign up. Then set up a personal list of libraries from your profile page by clicking on your user name at the top right of any screen.

  • All (1)
  • Unknown (1)
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.

User activity


e.g. test cricket, Perth (WA), "Parkes, Henry"

Separate different tags with a comma. To include a comma in your tag, surround the tag with double quotes.

Be the first to add a tag for this edition

Be the first to add this to a list

Comments and reviews

What are comments? Add a comment

No user comments or reviews for this version

Add a comment