Restricted simplicial decomposition: Computation and extensions
From MaRDI portal
Publication:3777773
DOI10.1007/BFb0121181zbMath0636.90027MaRDI QIDQ3777773
Donald W. Hearn, José A. Ventura, Siriphong Lawphongpanich
Publication date: 1987
Published in: Mathematical Programming Studies (Search for Journal in Brave)
traffic assignment; network flow; Frank-Wolfe algorithm; large-scale pseudoconvex programming; Restricted simplicial decomposition
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
90B10: Deterministic network models in operations research
49M27: Decomposition methods
Related Items
A dual scheme for traffic assignment problems, Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis, Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems, Restricted simplicial decomposition with side constraints, Fuzzy shortest paths, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, Approximation of the steepest descent direction for the O-D matrix adjustment problem, Finiteness in restricted simplicial decomposition, Postoptimizing equilibrium flows on large scale networks, Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems, A unified description of iterative algorithms for traffic equilibria, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, A survey of some mathematical programming models in transportation, A smooth penalty function algorithm for network-structured problems, Computational comparisons of dual conjugate gradient algorithms for strictly convex networks., Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions., Finite method for a nonlinear allocation problem, Dynamic traffic assignment: Considerations on some deterministic modelling approaches, Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints, Restricted simplicial decomposition for convex constrained problems, Application of the dual active set algorithm to quadratic network optimization, New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks, D-optimal design of a monitoring network for parameter estimation of distributed systems, A convergent decomposition algorithm for support vector machines, Decomposition techniques for the minimum toll revenue problem, A partial linearization method for the traffic assignment problem, Computational development of a lagrangian dual approach for quadratic networks
Uses Software
