Restricted simplicial decomposition: Computation and extensions
From MaRDI portal
Recommendations
- Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems
- Restricted simplicial decomposition for convex constrained problems
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- Finiteness in restricted simplicial decomposition
- A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network
Cited in
(40)- 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.
- Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints
- 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
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- An augmented Lagrangian decomposition method for block diagonal linear programming problems
- 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
- scientific article; zbMATH DE number 3852808 (Why is no real title available?)
- A partial linearization method for the traffic assignment problem
- Computational development of a lagrangian dual approach for quadratic networks
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- 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
- Simplicial Decomposition for Convex Generalized Networks
- Restricted simplicial decomposition with side constraints
- An Optimal Scanning Sensor Activation Policy for Parameter Estimation of Distributed Systems
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- A Derivative-Free Method for Structured Optimization Problems
- A heuristic method for the minimum toll booth problem
- Column generation algorithms for nonlinear optimization. II: Numerical investigations
- An oracle-based framework for robust combinatorial optimization
- Fuzzy shortest paths
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
- Approximation of the steepest descent direction for the O-D matrix adjustment problem
This page was built for publication: Restricted simplicial decomposition: Computation and extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777773)
