Using Extra Dual Cuts to Accelerate Column Generation

No abstract is available for this paper.

• Publication year

  2005

• Venue

  INFORMS journal on computing

• Publication date

  2005-04-15

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1287/ijoc.1030.0060
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Boxstep Method for Large-Scale Optimization

  2011cited by this paper
• Computational results with a primal-dual subproblem simplex method

  1999cited by this paper
• Stabilized column generation

  1998cited by this paper
• Crew scheduling, cutting stock, and column generation :Solving huge integer programs

  1993influential reference
• A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems

  1990cited by this paper
• Knapsack Problems: Algorithms and Computer Implementations

  1990cited by this paper
• OR-Library: Distributing Test Problems by Electronic Mail

  1990cited by this paper
• Optimization Theory of Large Systems

  1970cited by this paper
• A Linear Programming Approach to the Cutting Stock Problem---Part II

  1963cited by this paper
• A Linear Programming Approach to the Cutting-Stock Problem

  1961influential reference
• Decomposition Principle for Linear Programs

  1960cited by this paper

• Weighted quantum genetic algorithm for one-dimensional bin packing problem

  2025cites this paper
• Nested Set-Covering/Packing Problem: Degeneracy Alleviation and Dual Stabilization

  2025cites this paper
• Pricing Filtering in Dantzig-Wolfe Decomposition

  2024cites this paper
• Solving the skiving stock problem by a combination of stabilized column generation and the Reflect Arc-Flow model

  2023cites this paper
• Machine Learning-Supported Prediction of Dual Variables for the Cutting Stock Problem with an Application in Stabilized Column Generation

  2023cites this paper
• Automating Bin Packing: A Layer Building Matheuristics for Cost Effective Logistics

  2022cites this paper
• A Branch-and-Price Approach to a Variant of the Cognitive Radio Resource Allocation Problem

  2022cites this paper
• A Branch-and-Price Algorithm for the Multiple Knapsack Problem

  2022cites this paper
• One-dimensional multi-period cutting stock problem with two stages applied to lattice slab production

  2022cites this paper
• Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system

  2021cites this paper
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups

  2021cites this paper
• Mathematical models and approximate solution approaches for the stochastic bin packing problem

  2021cites this paper
• Solving Bin Packing Problems Using VRPSolver Models

  2021cites this paper
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems

  2020cites this paper
• Lexicographic Bin-Packing Optimization for Loading Trucks in a Direct-Shipping System

  2020cites this paper
• Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows

  2020cites this paper
• Arc Flow Formulations Based on Dynamic Programming: Theoretical Foundations and Applications

  2020cites this paper
• Mathematical model and solution approaches for integrated lot-sizing, scheduling and cutting stock problems

  2020cites this paper
• Exact solution techniques for two-dimensional cutting and packing

  2020influential citation
• A lexicographic pricer for the fractional bin packing problem

  2019cites this paper
• A branch-and-price algorithm for the temporal bin packing problem

  2019influential citation
• Data Association via Set Packing for Computer Vision Applications

  2019cites this paper
• The sharpest column : stabilizing column generation for the bin packing problem via a lexicographic pricer

  2018cites this paper
• Stabilized branch-and-price algorithms for vector packing problems

  2018influential citation
• Known Concepts and Solution Techniques

  2017cites this paper
• Lower bounds and algorithms for the minimum cardinality bin covering problem

  2017cites this paper
• Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems

  2017cites this paper
• New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers

  2017cites this paper
• Mathematical models and decomposition algorithms for cutting and packing problems

  2017influential citation
• Integrated Aircraft Routing, Crew Pairing, and Tail Assignment: Branch-and-Price with Many Pricing Problems

  2017influential citation
• Integer linear programming models for the skiving stock problem

  2016cites this paper
• Exactly solving packing problems with fragmentation

  2016cites this paper
• Dual Inequalities for Stabilized Column Generation Revisited

  2016influential citation
• Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities

  2016cites this paper
• Bin packing and cutting stock problems: Mathematical models and exact algorithms

  2016influential citation
• Solving large-scale fixed cost integer linear programming models for grid-based location problems with heuristic techniques

  2015cites this paper
• Vector Space Decomposition for Solving Large-Scale Linear Programs

  2015cites this paper
• Constraint Aggregation in Column Generation for Resource-Constrained Set-Covering Models

  2015influential citation
• A column generation approach for aircraft sequencing problems: a computational study

  2015cites this paper
• Vector Space Decomposition for Linear Programs

  2015cites this paper
• Efficient upper and lower bounding methods for flowshop sequence-dependent group scheduling problems

  2014cites this paper
• Lower and upper bounds for the Bin Packing Problem with Fragile Objects

  2014cites this paper
• Mathematical programming algorithms for bin packing problems with item fragmentation

  2014cites this paper
• Characterizing the optimality gap and the optimal packings for the bin packing problem

  2014cites this paper
• Runway Operations Management: Models, Enhancements, and Decomposition Techniques

  2014cites this paper
• Integrated Charge Batching and Casting Width Selection at Baosteel

  2014cites this paper
• Exact algorithms for the bin packing problem with fragile objects

  2013influential citation
• Stabilizing branch‐and‐price for constrained tree problems

  2013cites this paper
• 2 Context , Motivation and Literature Review 2 . 1 Column Generation for Set-Covering Formulations with Resource Constraints in the Subproblem

  2013cites this paper
• Title Suppressed Due to Excessive Length 3 2 The restricted dual polytope model

  2012cites this paper
• Convergent lower bounds for packing problems via restricted dual polytopes

  2012cites this paper
• On Integrating Theories of International Economics in the Strategic Planning of Global Supply Chains and Dynamic Supply Chain Reconfiguration with Capacity Expansion and Contraction

  2012cites this paper
• A column generation approach for power-aware optimization of virtualized heterogeneous server clusters

  2012cites this paper
• Large-scale mixed integer optimization approaches for scheduling airline operations under irregularity

  2012cites this paper
• Exactly solving a two‐level location problem with modular node capacities

  2012cites this paper
• Column generation for extended formulations

  2011cites this paper
• New Stabilization Procedures for the Cutting Stock Problem

  2011cites this paper
• An exact approach for the Vertex Coloring Problem

  2011cites this paper
• Acceleration and stabilization techniques for column generation applied to capacitated resource management problems

  2011cites this paper
• Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem

  2011cites this paper
• Column generation with dual inequalities for railway crew scheduling problems

  2011cites this paper
• Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment

  2011cites this paper
• On Stabilized Branch-and-Price for Constrained Tree Problems

  2011cites this paper
• Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem

  2011cites this paper
• Improvement of Column Generation Method for Railway Crew Scheduling Problems

  2010cites this paper
• An Inexact Bundle Approach to Cutting-Stock Problems

  2010cites this paper
• Exactly solving a two-level hierarchical location problem with modular node capacities

  2010cites this paper
• Column Generation

  2010cites this paper
• A note on branch-and-cut-and-price

  2010cites this paper
• A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint

  2010influential citation
• Algorithmes pour des problèmes de bin packing mono- et multi-objectif

  2010influential citation
• A generalization of column generation to accelerate convergence

  2009influential citation
• Efficient Traffic Grooming Scheme for WDM Network

  2009cites this paper
• Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009

  2009cites this paper
• Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design

  2008cites this paper
• An Effective Deflected Subgradient Optimization Scheme for Implementing Column Generation for Large-Scale Airline Crew Scheduling Problems

  2008cites this paper
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem

  2008cites this paper
• Accelerating column generation for variable sized bin-packing problems

  2007cites this paper
• A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times

  2007influential citation
• An extended model and a column generation algorithm for the planar multicommodity flow problem

  2007influential citation
• Models and algorithms for three-stage two-dimensional bin packing

  2007cites this paper
• Incremental flow

  2007cites this paper
• A branch, price, and cut approach to solving the maximum weighted independent set problem

  2007cites this paper
• On routing in large WDM networks

  2006cites this paper
• Estabilização da geração de colunas aplicada no problema de corte de estoque

  2006cites this paper
• OPTIMIZING THE EFFICIENCY OF THE UNITED STATES ORGAN ALLOCATION SYSTEM THROUGH REGION REORGANIZATION

  2006cites this paper
• A column generation approach for SONET ring assignment

  2006cites this paper
• A generic view of Dantzig-Wolfe decomposition in mixed integer programming

  2006cites this paper
• Two new families of large compound graphs

  2006cites this paper
• Cutting Stock Problems

  2005cites this paper
• A Primer in Column Generation

  2005cites this paper
• Implementing Mixed Integer Column Generation

  2005cites this paper
• Using Circuit Variables to Accelerate Column Generation in Planar Multicommodity Flows

  2005cites this paper
• Integer programming column generation strategies for the cutting stock problem and its variants

  2005influential citation
• Branch-and-price and multicommodity flows

  2005cites this paper
• Resolução de Problemas de Programação de Máquinas Paralelas pelo Método de Partição e Geração de Colunas

  2004cites this paper
• Dual-Optimal Inequalities for Stabilized Column Generation

  2003influential citation
• Selected Topics in Column Generation

  2002cites this paper
• Submitted to Informs Journal on Computing Manuscript (please, Provide the Mansucript Number!) Convergent Dual Bounds Using an Aggregation of Set-covering Constraints for Capacitated Problems

  year unknowncites this paper
• D EGENERACY N O M ORE : A S URPERISINGLY S IMPLE M ETHOD A P REPRINT

  year unknowncites this paper