A partial linearization method for the traffic assignment problem (Q3835623): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1080/02331939308843903 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028328252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reduced Gradient Algorithm for Nonlinear Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation Methods for Network Flow Problems with Convex Arc Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Row-Action Methods for Huge and Sparse Systems and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the dual coordinate ascent approach for nonlinear networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted simplicial decomposition: Computation and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm to maximize certain pseudoconcave functions on polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial decomposition in nonlinear programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for nonlinear programs over Cartesian product sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Frank–Wolfe Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal-Dual Traffic Assignment Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed algorithm for convex network optimization problems / rank
 
Normal rank

Latest revision as of 12:10, 23 May 2024

scientific article
Language Label Description Also known as
English
A partial linearization method for the traffic assignment problem
scientific article

    Statements

    A partial linearization method for the traffic assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 April 1995
    0 references
    convex multi-commodity network flows
    0 references
    feasible direction methods
    0 references
    partial linearization
    0 references
    Lagrangean duality
    0 references
    coordinate ascent
    0 references
    traffic assignment
    0 references
    separable approximation
    0 references
    nonseparable objective function
    0 references
    Frank-Wolfe algorithm
    0 references

    Identifiers