Using the primal-dual interior point algorithm within the branch-price-and-cut method
From MaRDI portal
Publication:336429
Recommendations
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- scientific article; zbMATH DE number 4164543
- On the Implementation of a Primal-Dual Interior Point Method
- Improving a primal–dual simplex-type algorithm using interior point methods
- scientific article; zbMATH DE number 5630197
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Publication:4864961
- scientific article; zbMATH DE number 964349
- scientific article; zbMATH DE number 5661385
- A primal-dual interior-point algorithm for quadratic programming
Cites work
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- 2-path cuts for the vehicle routing problem with time windows
- A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis
- A new polynomial-time algorithm for linear programming
- A proximal trust-region algorithm for column generation stabilization
- A reoptimization algorithm for the shortest path problem with time windows
- A tutorial on column generation and branch-and-price for vehicle routing problems
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- An algorithm for the resource constrained shortest path problem
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- An improved column generation algorithm for minimum sum-of-squares clustering
- Comparison of bundle and classical column generation
- Computational Experience with an Interior Point Cutting Plane Algorithm
- Cutting planes for branch-and-price algorithms
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Further development of multiple centrality correctors for interior point methods
- Generalized Bundle Methods
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- Interior point methods 25 years later
- Multiple centrality corrections in a primal-dual method for linear programming
- New developments in the primal-dual column generation technique
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- On compact formulations for integer programs solved by column generation
- On constrained optimization by adjoint based quasi-Newton methods
- On interior-point warmstarts for linear and combinatorial optimization
- On the choice of explicit stabilizing terms in column generation
- Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Reformulation and decomposition of integer programs
- Reoptimization With the Primal-Dual Interior Point Method
- Solving combinatorial optimization problems using Karmarkar's algorithm
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- Stabilized dynamic constraint aggregation for solving set partitioning problems
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- Vehicle Routing Problem with Time Windows
- Vehicle routing problem with elementary shortest path based column generation
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
- Warm start of the primal-dual method applied in the cutting-plane scheme
- Warm-start strategies in interior-point methods for linear programming
Cited in
(19)- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
- Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen
- Solving the minimum convex partition of point sets with integer programming
- Design and implementation of a modular interior-point solver for linear optimization
- Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm
- Improved branching disjunctions for branch-and-bound: an analytic center approach
- Regularized optimization methods for convex MINLP problems
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
- Interior-point solver for convex separable block-angular problems
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
- A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service
- Large-scale optimization with the primal-dual column generation method
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- The vehicle allocation problem: alternative formulation and branch-and-price method
- A column generation-based heuristic for the split delivery vehicle routing problem with time windows
This page was built for publication: Using the primal-dual interior point algorithm within the branch-price-and-cut method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336429)
