Column generation algorithms for nonlinear optimization. II: Numerical investigations
From MaRDI portal
Publication:609805
DOI10.1016/j.cor.2010.07.021zbMath1206.90176OpenAlexW2140318678MaRDI QIDQ609805
Ricardo García-Ródenas, Michael Patriksson, ángel G. Marín
Publication date: 1 December 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.07.021
Related Items (2)
Master problem approximations in Dantzig-Wolfe decomposition of variational inequality problems with applications to two energy market models ⋮ Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
- A comparison of feasible direction methods for the stochastic transportation problem
- Finiteness in restricted simplicial decomposition
- Nonlinear programming and variational inequality problems. A unified approach
- Restricted simplicial decomposition for convex constrained problems
- Restricted simplicial decomposition: Computation and extensions
- Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Simplicial decomposition in nonlinear programming algorithms
- Network Equilibrium Models with Combined Modes
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- Projected Newton Methods for Optimization Problems with Simple Constraints
- An extension of the frank and Wolfe method of feasible directions
- Some Algorithms for Minimizing a Function of Several Variables
- Convex programming in Hilbert space
This page was built for publication: Column generation algorithms for nonlinear optimization. II: Numerical investigations
