Primal-dual simplex method for multiobjective linear programming (Q2471113): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q319963
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-007-9232-y / rank
Normal rank
 
Property / author
 
Property / author: Antonio M. Rodríguez-Chía / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Qhull / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58217279 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10957-007-9232-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027241495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outcome space partition of the weight set in multiobjective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4669350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper efficiency and the theory of vector maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickhull algorithm for convex hulls / 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: Off-Line Maintenance of Planar Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. / 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: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10957-007-9232-Y / rank
 
Normal rank

Latest revision as of 20:21, 18 December 2024

scientific article
Language Label Description Also known as
English
Primal-dual simplex method for multiobjective linear programming
scientific article

    Statements

    Primal-dual simplex method for multiobjective linear programming (English)
    0 references
    0 references
    0 references
    18 February 2008
    0 references
    Multiobjective linear programming
    0 references
    Primal-dual simplex algorithm
    0 references

    Identifiers