Inverse minimum cost flow problems under the weighted Hamming distance (Q992575): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse Optimization / 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: Inverse combinatorial optimization: a survey on problems, methods, and results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained inverse min-max spanning tree problems under the weighted Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse min-max spanning tree problem under the weighted sum-type Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse maximum flow problems under the weighted Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The center location improvement problem under the Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating some inverse linear programming problems / rank
 
Normal rank

Latest revision as of 04:46, 3 July 2024

scientific article
Language Label Description Also known as
English
Inverse minimum cost flow problems under the weighted Hamming distance
scientific article

    Statements

    Inverse minimum cost flow problems under the weighted Hamming distance (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 September 2010
    0 references
    network flows
    0 references
    inverse problem
    0 references
    Hamming distance
    0 references
    APX-hard
    0 references
    strongly polynomial algorithm
    0 references

    Identifiers