Solving combinatorial problems with combined min-max-min-sum objective and applications (Q1824562): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most and least uniform spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple version of Karzanov's blocking flow algorithm / rank
 
Normal rank

Latest revision as of 10:00, 20 June 2024

scientific article
Language Label Description Also known as
English
Solving combinatorial problems with combined min-max-min-sum objective and applications
scientific article

    Statements

    Solving combinatorial problems with combined min-max-min-sum objective and applications (English)
    0 references
    1989
    0 references
    bottleneck cost function
    0 references
    linear cost function
    0 references
    matchings
    0 references
    matroid intersection
    0 references
    weighted edge coloring
    0 references
    bicriterion analysis
    0 references
    0 references

    Identifiers

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