Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems (Q885822): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Inverse combinatorial optimization: a survey on problems, methods, and results / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving the Convex Cost Integer Dual Network Flow Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Weighted inverse minimum spanning tree problems under Hamming distance / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing a Convex Cost Closure Set / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The center location improvement problem under the Hamming distance / rank | |||
Normal rank | |||
Revision as of 09:05, 26 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems |
scientific article |
Statements
Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems (English)
0 references
14 June 2007
0 references
sorting problem
0 references
inverse problem
0 references
partial inverse problem
0 references
Hamming distance
0 references
permutation
0 references
0 references
