On the computation of all supported efficient solutions in multi-objective integer network flow problems (Q1042100): 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: Q3160276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding non-dominated solutions in bi-objective integer network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual simplex algorithm for bi-objective network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general method for determining the set of all efficient solutions to a linear vectormaximum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on \(K\) best network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple objective minimum cost flow problems: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria network flow problems: Integer case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the biobjective integer minimum cost flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815146 / rank
 
Normal rank

Revision as of 05:45, 2 July 2024

scientific article
Language Label Description Also known as
English
On the computation of all supported efficient solutions in multi-objective integer network flow problems
scientific article

    Statements

    On the computation of all supported efficient solutions in multi-objective integer network flow problems (English)
    0 references
    0 references
    0 references
    7 December 2009
    0 references
    multi-objective linear and integer programming
    0 references
    multi-objective network flows
    0 references
    negative-cycle algorithms
    0 references
    parametric programming
    0 references

    Identifiers