Some new results on inverse sorting problems

Lecture Notes in Computer Science

Volumn 3595, Issue , 2005, Pages 985-992

  Yang, Xiao Guang ^a   Zhang, Jian Zhong ^b  

^a CHINESE ACADEMY OF SCIENCES   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Hamming distance; Inverse problem; Optimization; Partial inverse problem; Sorting problem

Indexed keywords

COMPUTER SCIENCE; PROBLEM SOLVING; COMBINATORIAL MATHEMATICS; HAMMING DISTANCE; OPTIMIZATION;

BOUND CONSTRAINTS; HAMMING DISTANCE; INVERSE SORTING PROBLEMS; NEW RESULTS; WEIGHTED HAMMING DISTANCES;

INVERSE PROBLEMS;

EID: 26844437677     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11533719_99     Document Type: Conference Paper

References (4)

1. R.K. Ahuja, Inverse optimization, Slides of talk given at Georgia Institute of Technology, Atlanta, GA; November 1998, downloadable from http://www.ise.ufl.edu/ahuja/
2. R.K. Ahuja, and J.B. Orlin, A fast scaling algorithm for minimizing separable convex functions subject to chain constraints, Operations Research, 49, 2001, 784-789.
3. Y. He, B.W. Zhang, and E.Y. Yao, Weighted inverse minimum spanning tree problems under Hamming distance, Journal of Combinatorial Optimization, 9, 2005, 91-100.
4. B.W. Zhang, J.Z. Zhang, and Y. He, The center location improvement problem under the Hamming distance, Journal of Combinatorial Optimization, to appear.