Go to main content

Home
About GNOM
Members
- UPC Members
- External Collaborators
Scientific production
Projects
Academic activity
Recognitions
- UPC Members Recognitions

Search Site

Advanced Search…

Menú

Search Site

Advanced Search…

Home
About GNOM
Members
- UPC Members
- External Collaborators
Scientific production
Projects
Academic activity
Recognitions
- UPC Members Recognitions
Log in

Group of Numerical Optimization and Modeling. GNOM

Home
PDFs
Reports
Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem

Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem https://gnom.upc.edu/en/PDFs/reports/using-accpm-in-a-simplicial-decomposition-algorithm-for-the-traffic-assignment-problem/view https://gnom.upc.edu/++theme++genweb6.theme/img/logo.png

Share:

Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem

dr2002-04.pdf

application/pdf

239.6 KB

Download

Navigation

Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning
A stochastic programming approach to cash management in banking
A shortest paths heuristic for statistical disclosure control in positive tables
Solving quadratic multicommodity problems through an interior-point algorithm
Recent advances in the solution of the multicommodoty flow problem
Statistical disclosure control in tabular data
Block coordinate descent decomposition for statistical data protection using controlled tabular adjustment
Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
User's and programmer's manual of the RCTA package
Quadratic regularizations in an interior-point method for primal block-angular problems
User's and programmer's manual of the network flows heuristic package for cell suppression in 1H2D tables
Solving the traffic assignment problem using ACCPM
Using modelling languages for the complementary cell suppression problem through network flows
HTCOOR Program documentation
The long-term hydrothermal coordination model implemented in the HTCOOR package
An introduction to the affine scaling algorithm for linear programming
Optimum transmission and distribution network expansion at several voltage levels through multicommodity network flows
Reference manual for the electric expansion codes
PPRN 1.0, User's Guide
Computational tests of a nonlinear multicommodity network flow code with linear side constraints through primal partitioning
Computational tests of a linear multicommodity network flow code with linear side constraints through primal partitioning
Efficient computation and updating of the working matrix of the primal partitioning method for multicommodity flow problems with side constraints
Existence and uniqueness of the regularized primal-dual central path
Improving electricity market price scenarios by means of forecasting factor models
Generació de la corba d'oferta a partir de les dades públiques del MIBEL
Optimal Bidding Strategies for Thermal and Generic Programming Units in the Day-ahead Electricity Market
A stochastic programming model for the optimal electricity market bid problem with bilateral contracts for thermal and combined cycle units
Generació de figures eps a partir dels resultats d'AMPL
A decision support for a Price-Taker producer operating on Day-Ahead and Physical Derivatives Electricity Markets
A Stochastic Programming Model for the Thermal Optimal Day-Ahead Bid Problem with Physical Futures Contracts
Warmstarting for interior-point methods applied to the long-term power planning
Long-term electric power planning using the Bloom and Gallant's linear model. A comparison of solution techniques
Long-term electric power planning in a competitive market using the Bloom and Gallant's model
Método de Pontos Interiores com Técnicas de Região de Garantia para Resolver o Problema de Fluxo de Potência Ótimo Reativo
Minimum-distance controlled perturbation methods for large-scale tabular data protection
User’s and programmer’s manual of the network flows
Automatic Structure Detection in Constraints of
An interior-point approach for primal block-angular problems
Minimum-distance controlled perturbation methods for large-scale tabular data protection
Warmstarting for interior-point methods applied to the long-term power planning
CorcheroMijangosHeredia_DRDEIO1-04(TOP)_11.pdf

Where we are

Contact

Group of Numerical Optimization and Modelling

Campus Diagonal Nord, Building C5. C. Jordi Girona, 1-3 08034 Barcelona

Tel.: 93 401 58 54 (Castro) ; 93 401 70 35 (Nabona)

E-mail: jordi.castro@upc.edu ; narcis.nabona@upc.edu

© UPC Group of Numerical Optimization and Modeling. GNOM.

Powered by
Site Map
Accessibility
Disclaimer
Privacy Settings