On the choice of explicit stabilizing terms in column generation

DOI10.1016/j.dam.2008.06.021zbMath1169.90395OpenAlexW2162995463WikidataQ118165488 ScholiaQ118165488MaRDI QIDQ1025985

Antonio Frangioni, Hatem M. T. Ben Amor, Jacques Desrosiers

Publication date: 23 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.06.021

zbMATH Keywords

column generationbundle methodsproximal point methodsvehicle and crew scheduling problems

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (51)

A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen ⋮ Scalable branching on dual decomposition of stochastic mixed-integer programming problems ⋮ On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming ⋮ Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support ⋮ A column-generation-based algorithm for a resource-constrained project scheduling problem with a fractional shared resource ⋮ A generalization of column generation to accelerate convergence ⋮ Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem ⋮ Using the primal-dual interior point algorithm within the branch-price-and-cut method ⋮ A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints ⋮ A comparison of formulations and relaxations for cross-dock door assignment problems ⋮ The positive edge criterion within COIN-OR's CLP ⋮ A stabilized structured Dantzig-Wolfe decomposition method ⋮ Stabilizing branch‐and‐price for constrained tree problems ⋮ Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows ⋮ A multiperiod drayage problem with customer-dependent service periods ⋮ A column generation-based algorithm for midterm nurse scheduling with specialized constraints, preference considerations, and overtime ⋮ A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems ⋮ Dynamic constraint and variable aggregation in column generation ⋮ Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems ⋮ Configuration‐based approach for topological problems in the design of wireless sensor networks ⋮ On the computational efficiency of subgradient methods: a case study with Lagrangian bounds ⋮ Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems ⋮ A class of Dantzig-Wolfe type decomposition methods for variational inequality problems ⋮ Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling ⋮ Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation ⋮ Optimal Design of the Seasonal Influenza Vaccine with Manufacturing Autonomy ⋮ Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design ⋮ Convex proximal bundle methods in depth: a unified analysis for inexact oracles ⋮ Communication-Constrained Expansion Planning for Resilient Distribution Systems ⋮ Minimizing value-at-risk in single-machine scheduling ⋮ Regularized optimization methods for convex MINLP problems ⋮ Bundle methods for sum-functions with ``easy components: applications to multicommodity network design ⋮ Stabilized dynamic constraint aggregation for solving set partitioning problems ⋮ A Lagrangian heuristic for satellite range scheduling with resource constraints ⋮ Regularized decomposition of large scale block-structured robust optimization problems ⋮ A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example ⋮ One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model ⋮ Reformulations in Mathematical Programming: Definitions and Systematics ⋮ A lexicographic pricer for the fractional bin packing problem ⋮ Convexity and optimization with copulæ structured probabilistic constraints ⋮ Vector Space Decomposition for Solving Large-Scale Linear Programs ⋮ School bus routing—a column generation approach ⋮ Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design ⋮ A shortest path-based approach to the multileaf collimator sequencing problem ⋮ A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows ⋮ A note on the primal-dual column generation method for combinatorial optimization ⋮ Cutting planes for branch-and-price algorithms ⋮ An exact approach to extend network lifetime in a general class of wireless sensor networks ⋮ Rail schedule optimisation in the hunter valley coal chain ⋮ Row-reduced column generation for degenerate master problems ⋮ On generalized surrogate duality in mixed-integer nonlinear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• About Lagrangian methods in integer optimization
• A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
• An inexact bundle variant suited to column generation
• Stabilized column generation
• A bundle Bregman proximal method for convex nondifferentiable minimization
• New variants of bundle methods
• A descent method with linear programming subproblems for nondifferentiable convex optimization
• Interior point stabilization for column generation
• Comparison of bundle and classical column generation
• Solving semidefinite quadratic problems within nonsmooth optimization algorithms
• A proximal trust-region algorithm for column generation stabilization
• Decomposition Principle for Linear Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• The Cutting-Plane Method for Solving Convex Programs
• A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
• A branch and bound algorithm for the multiple depot vehicle scheduling problem
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• Monotone Operators and the Proximal Point Algorithm
• The B<scp>oxstep</scp> Method for Large-Scale Optimization
• A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
• On Smoothing Exact Penalty Functions for Convex Constrained Optimization
• Convergence of Proximal-Like Algorithms
• Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems
• Generalized Bundle Methods
• Bundle methods in stochastic optimal power management: A disaggregated approach using preconditioners

This page was built for publication: On the choice of explicit stabilizing terms in column generation