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.028zbMath1348.90478OpenAlexW2065967558MaRDI QIDQ336429
Jacek Gondzio, Pedro Augusto 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
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Interior-point methods (90C51)
Related Items (18)
Large-scale optimization with the primal-dual column generation method ⋮ A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen ⋮ Solving the minimum convex partition of point sets with integer programming ⋮ Improved branching disjunctions for branch-and-bound: an analytic center approach ⋮ The vehicle allocation problem: alternative formulation and branch-and-price method ⋮ 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 ⋮ A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service ⋮ A heuristic approach to minimize the number of saw cycles in small-scale furniture factories ⋮ Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm ⋮ Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation ⋮ A column generation-based heuristic for the split delivery vehicle routing problem with time windows ⋮ 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 ⋮ Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints ⋮ Interior-point solver for convex separable block-angular problems ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Interior point methods 25 years later
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
- 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
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- An improved column generation algorithm for minimum sum-of-squares clustering
- A new polynomial-time algorithm for linear programming
- On compact formulations for integer programs solved by column generation
- 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
- Further development of multiple centrality correctors for interior point methods
- A reoptimization algorithm for the shortest path problem with time windows
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- Solving combinatorial optimization problems using Karmarkar's algorithm
- Warm start of the primal-dual method applied in the cutting-plane scheme
- Multiple centrality corrections in a primal-dual method for linear programming
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- Stabilized dynamic constraint aggregation for solving set partitioning 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
- Vehicle routing problem with elementary shortest path based column generation
- A proximal trust-region algorithm for column generation stabilization
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- Warm-Start Strategies in Interior-Point Methods for Linear Programming
- Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- On Interior-Point Warmstarts for Linear and Combinatorial Optimization
- Cutting planes for branch-and-price algorithms
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- 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
- Reformulation and Decomposition of Integer Programs
- An algorithm for the resource constrained shortest path problem
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- On constrained optimization by adjoint based quasi-Newton methods
- Reoptimization With the Primal-Dual Interior Point Method
- Computational Experience with an Interior Point Cutting Plane Algorithm
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Generalized Bundle Methods
- 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
