Inverse minimum flow problem under the weighted sum-type Hamming distance (Q2012059): 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: Combinatorial algorithms for inverse network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an instance of the inverse shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse minimum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse maximum flow problem considering<i>l</i><sub>∞</sub>norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse maximum flow problem with lower and upper bounds for the flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some inverse optimization problems under the Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse 1-median problem on trees under weighted Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity inverse minimum cost flow problem / 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 cost flow problems under the weighted Hamming distance / 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: Inverse min-max spanning tree problem under the weighted sum-type Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted inverse maximum perfect matching problems under the Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity inverse minimum cost flow problems under the weighted 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: The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max flows in O(nm) time, or better / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on ``Inverse minimum cost 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: Inverse maximum flow and minimum cut 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

Revision as of 04:14, 14 July 2024

scientific article
Language Label Description Also known as
English
Inverse minimum flow problem under the weighted sum-type Hamming distance
scientific article

    Statements

    Inverse minimum flow problem under the weighted sum-type Hamming distance (English)
    0 references
    0 references
    27 July 2017
    0 references
    minimum flow
    0 references
    minimum cut
    0 references
    inverse problem
    0 references
    Hamming distance
    0 references
    strongly polynomial algorithm
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references