A note on \(K\) best network flows (Q1897375): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-optimal solution sets for some polynomially solvable scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal cost flows in regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection of Two Matroids: (Condensed) Border Graphs and Ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thek best spanning arborescences of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for finding k-best perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on combinatorial optimization with max-linear objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Algorithms for Generating Weighted Spanning Trees in Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new exchange property for matroids and its application to max-min-problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding the K best cuts in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3716769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality for balanced submodular flows / rank
 
Normal rank

Latest revision as of 15:56, 23 May 2024

scientific article
Language Label Description Also known as
English
A note on \(K\) best network flows
scientific article

    Statements

    A note on \(K\) best network flows (English)
    0 references
    0 references
    30 May 1996
    0 references
    linear integer network flow
    0 references
    polynomial time algorithm
    0 references
    multiple-criteria network flow
    0 references

    Identifiers