A new warmstarting strategy for the primal-dual column generation method
From MaRDI portal
Publication:494315
DOI10.1007/s10107-014-0779-8zbMath1327.90389OpenAlexW2059094681MaRDI QIDQ494315
Pablo González-Brevis, Jacek Gondzio
Publication date: 31 August 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-014-0779-8
linear programmingcolumn generationinterior point methodscutting stock problemvehicle routing problem with time windowswarmstarting
Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) Numerical methods of relaxation type (49M20)
Related Items
Large-scale optimization with the primal-dual column generation method, A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem, A specialized primal-dual interior point method for the plastic truss layout optimization, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
Uses Software
Cites Work
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- Further development of multiple centrality correctors for interior point methods
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
- Solving combinatorial optimization problems using Karmarkar's algorithm
- Condition measures and properties of the central trajectory of a linear program
- Warm start of the primal-dual method applied in the cutting-plane scheme
- An interior point method in Dantzig-Wolfe decomposition
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
- New developments in the primal-dual column generation technique
- Comparison of bundle and classical column generation
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- Multiple Cuts in the Analytic Center Cutting Plane Method
- Warm-Start Strategies in Interior-Point Methods for Linear Programming
- An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- On Interior-Point Warmstarts for Linear and Combinatorial Optimization
- A Linear Programming Approach to the Cutting-Stock Problem
- The Decomposition Algorithm for Linear Programs
- A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Reoptimization With the Primal-Dual Interior Point Method
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Selected Topics in Column Generation
- An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
- Vehicle Routing Problem with Time Windows
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
