Column Generation based Primal Heuristics
From MaRDI portal
Publication:2883638
DOI10.1016/j.endm.2010.05.088zbMath1237.90263OpenAlexW2072433682MaRDI QIDQ2883638
No author found.
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.088
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (45)
All-integer column generation for set partitioning: basic principles and extensions ⋮ A branch-and-price-and-cut approach for sustainable crop rotation planning ⋮ Distributed integral column generation for set partitioning problems ⋮ The discrete time window assignment vehicle routing problem ⋮ A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes ⋮ Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce ⋮ Optimal interval scheduling with a resource constraint ⋮ A new heuristic branching scheme for the crew pairing problem with base constraints ⋮ Optimal Physician assignment and patient demand allocation in an outpatient care network ⋮ An exact algorithm for parallel machine scheduling with conflicts ⋮ A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering ⋮ A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts ⋮ A comparison of integer programming models for the partial directed weighted improper coloring problem ⋮ Variable neighborhood search accelerated column generation for the nurse rostering problem ⋮ An integer programming column generation principle for heuristic search methods ⋮ A column‐generation‐based approach to fleet design problems mixing owned and hired vehicles ⋮ Delay resistant line planning with a view towards passenger transfers ⋮ A set-covering based heuristic algorithm for the periodic vehicle routing problem ⋮ Bin Packing Problem with Time Lags ⋮ Integral Column Generation for Set Partitioning Problems with Side Constraints ⋮ Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems ⋮ New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems ⋮ Adaptive solution prediction for combinatorial optimization ⋮ Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints ⋮ Two extended formulations for the virtual network function placement and routing problem ⋮ A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand ⋮ Primal Heuristics for Branch and Price: The Assets of Diving Methods ⋮ A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks ⋮ Column generation based primal heuristics for routing and loading problems ⋮ An exact approach for the personnel task rescheduling problem with task retiming ⋮ Column generation for vehicle routing problems with multiple synchronization constraints ⋮ Directed weighted improper coloring for cellular channel allocation ⋮ The distance constrained multiple vehicle traveling purchaser problem ⋮ Primal Heuristics for Branch-and-Price Algorithms ⋮ Bin packing problem with conflicts and item fragmentation ⋮ A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing ⋮ An efficient column generation approach for practical railway crew scheduling with attendance rates ⋮ Formulations for a problem of petroleum transportation ⋮ The one-dimensional cutting stock problem with sequence-dependent cut losses ⋮ The split delivery capacitated team orienteering problem ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems ⋮ On the benchmark instances for the bin packing problem with conflicts ⋮ Generalized relax-and-fix heuristic ⋮ The min-max close-enough arc routing problem ⋮ Column-generation based bounds for the homogeneous areas problem
Uses Software
Cites Work
- Unnamed Item
- Branching in branch-and-price: A generic scheme
- A survey of very large-scale neighborhood search techniques
- Local branching
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Improving the feasibility pump
- The feasibility pump
- An Inexact Bundle Approach to Cutting-Stock Problems
- Algorithms for the Bin Packing Problem with Conflicts
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- A heuristic column generation method for the heterogeneous fleet VRP
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- A set‐partitioning‐based exact algorithm for the vehicle routing problem
This page was built for publication: Column Generation based Primal Heuristics
