Solving scalarized multi-objective network flow problems using an interior point method (Q3002548): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: José Rui Figueira / rank
Normal rank
 
Property / author
 
Property / author: Mauricio G. C. Resende / rank
Normal rank
 
Property / author
 
Property / author: José Rui Figueira / rank
 
Normal rank
Property / author
 
Property / author: Mauricio G. C. Resende / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PDNET / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1111/j.1475-3995.2010.00761.x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038326020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interactive interior point algorithm for multiobjective linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior multiobjective linear programming algorithm / 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: A multiobjective interior primal-dual linear programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior Multiple Objective Primal-dual Linear Programming Algorithm Using Efficient Anchoring Points / 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: Using aspiration levels in an interactive interior multiobjective linear programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5688012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using objective values to start multiple objective linear programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating interior search directions for multiobjective linear programming using approximate gradients and efficient anchoring points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple criteria decision analysis. State of the art surveys / rank
 
Normal rank
Property / cites work
 
Property / cites work: A QMR-based interior-point algorithm for solving linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual infeasible-interior-point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A visual interactive method for solving the multiple criteria problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of Inexact Infeasible-Interior-Point Algorithms for Solving Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of a Primal-Dual Interior Point Method for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. I: Linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Investigation of Interior-Point Algorithms for the Linear Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fortran subroutines for network flow optimization using an interior point algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness and constructiveness of parametric characterizations to vector optimization problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:42, 4 July 2024

scientific article
Language Label Description Also known as
English
Solving scalarized multi-objective network flow problems using an interior point method
scientific article

    Statements

    Solving scalarized multi-objective network flow problems using an interior point method (English)
    0 references
    0 references
    0 references
    0 references
    20 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    achievement functions
    0 references
    decision-making
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references