Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems (Q885822): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10589-006-0394-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2043555187
@@ Property / OpenAlex ID: W2043555187 / rank @@
+Normal rank
@@ Property / cites work @@
+Inverse combinatorial optimization: a survey on problems, methods, and results
+Normal rank
@@ Property / cites work @@
+Solving the Convex Cost Integer Dual Network Flow Problem
+Normal rank
@@ Property / cites work @@
+A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints
+Normal rank
@@ Property / cites work @@
+Weighted inverse minimum spanning tree problems under Hamming distance
+Normal rank
@@ Property / cites work @@
+Minimizing a Convex Cost Closure Set
@@ Property / cites work: Minimizing a Convex Cost Closure Set / rank @@
+Normal rank
@@ Property / cites work @@
+The center location improvement problem under the Hamming distance
+Normal rank