Inverse maximum flow problems under the weighted Hamming distance (Q2385473): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some inverse optimization problems under the Hamming distance / 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: Constrained inverse minimum spanning tree problems under the bottleneck-type 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: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / 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: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The center location improvement problem under the Hamming distance / rank
 
Normal rank

Latest revision as of 10:59, 27 June 2024

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

    Statements