Pages that link to "Item:Q3777773"
From MaRDI portal
The following pages link to Restricted simplicial decomposition: Computation and extensions (Q3777773):
Displaying 30 items.
- Conditional gradient algorithms for norm-regularized smooth convex optimization (Q494314) (← links)
- A heuristic method for the minimum toll booth problem (Q604959) (← links)
- Column generation algorithms for nonlinear optimization. II: Numerical investigations (Q609805) (← links)
- Fuzzy shortest paths (Q805505) (← links)
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications (Q811414) (← links)
- Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem (Q849087) (← links)
- Approximation of the steepest descent direction for the O-D matrix adjustment problem (Q867565) (← links)
- Finiteness in restricted simplicial decomposition (Q1069859) (← links)
- Postoptimizing equilibrium flows on large scale networks (Q1278241) (← links)
- Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems (Q1304774) (← links)
- A unified description of iterative algorithms for traffic equilibria (Q1322143) (← links)
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method (Q1361108) (← links)
- A survey of some mathematical programming models in transportation (Q1367685) (← links)
- A smooth penalty function algorithm for network-structured problems (Q1388940) (← links)
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. (Q1406626) (← links)
- Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions. (Q1427572) (← links)
- Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints (Q1761747) (← links)
- Finite method for a nonlinear allocation problem (Q1896578) (← links)
- Dynamic traffic assignment: Considerations on some deterministic modelling approaches (Q1908277) (← links)
- Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints (Q1970426) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- An augmented Lagrangian decomposition method for block diagonal linear programming problems (Q2314414) (← links)
- Restricted simplicial decomposition for convex constrained problems (Q2366609) (← links)
- Application of the dual active set algorithm to quadratic network optimization (Q2366828) (← links)
- New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks (Q2433515) (← links)
- D-optimal design of a monitoring network for parameter estimation of distributed systems (Q2454730) (← links)
- A convergent decomposition algorithm for support vector machines (Q2475612) (← links)
- Decomposition techniques for the minimum toll revenue problem (Q3156828) (← links)
- Restricted simplicial decomposition with side constraints (Q4894858) (← links)
- An oracle-based framework for robust combinatorial optimization (Q6183084) (← links)
