Capacity inverse minimum cost flow problems under the weighted Hamming distance (Q315493): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-015-0919-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W833648316 / rank
 
Normal rank
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: On an instance of the inverse shortest paths problem / 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: 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: On the approximability of the maximum common subgraph problem / 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: 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: 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 14:13, 12 July 2024

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

    Statements

    Capacity inverse minimum cost flow problems under the weighted Hamming distance (English)
    0 references
    0 references
    0 references
    21 September 2016
    0 references
    minimum cost flow
    0 references
    inverse problem
    0 references
    Hamming distance
    0 references
    APX-hard
    0 references
    strongly polynomial algorithm
    0 references

    Identifiers