Using the primal-dual interior point algorithm within the branch-price-and-cut method
From MaRDI portal
Publication:336429
DOI10.1016/J.COR.2013.02.028zbMATH Open1348.90478OpenAlexW2065967558MaRDI QIDQ336429FDOQ336429
Authors: Jacek Gondzio, Pedro Munari 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/10692654/Using_the_primal_dual_interior_point_algorithm_within_the_branch_price_and_cut_method.pdf
Recommendations
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- scientific article
- 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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Interior-point methods (90C51) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- A reoptimization algorithm for the shortest path problem with time windows
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Interior point methods 25 years later
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Generalized Bundle Methods
- Warm start of the primal-dual method applied in the cutting-plane scheme
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- 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
- Warm-start strategies in interior-point methods for linear programming
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- On interior-point warmstarts for linear and combinatorial optimization
- A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis
- On constrained optimization by adjoint based quasi-Newton methods
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- Further development of multiple centrality correctors for interior point methods
- Vehicle Routing Problem with Time Windows
- Reoptimization With the Primal-Dual Interior Point Method
- An improved column generation algorithm for minimum sum-of-squares clustering
- Vehicle routing problem with elementary shortest path based column generation
- 2-path cuts for the vehicle routing problem with time windows
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- Multiple centrality corrections in a primal-dual method for linear programming
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- Stabilized dynamic constraint aggregation for solving set partitioning problems
- Cutting planes for branch-and-price algorithms
- Reformulation and decomposition of integer programs
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
- An algorithm for the resource constrained shortest path problem
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- A tutorial on column generation and branch-and-price for vehicle routing problems
- On the choice of explicit stabilizing terms in column generation
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- Solving combinatorial optimization problems using Karmarkar's algorithm
- A proximal trust-region algorithm for column generation stabilization
- Computational Experience with an Interior Point Cutting Plane Algorithm
- On compact formulations for integer programs solved by column generation
Cited In (19)
- Solving the minimum convex partition of point sets with integer programming
- Large-scale optimization with the primal-dual column generation method
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
- Improved branching disjunctions for branch-and-bound: an analytic center approach
- The vehicle allocation problem: alternative formulation and branch-and-price method
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
- Interior-point solver for convex separable block-angular problems
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
- A column generation-based heuristic for the split delivery vehicle routing problem with time windows
- A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service
- Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
- Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- Design and implementation of a modular interior-point solver for linear optimization
- Regularized optimization methods for convex MINLP problems
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
Uses Software
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)
