An exact algorithm for IP column generation
From MaRDI portal
Publication:1360108
DOI10.1016/0167-6377(96)00033-8zbMath0873.90074OpenAlexW2013479503MaRDI QIDQ1360108
Laurence A. Wolsey, François Vanderbeck
Publication date: 15 July 1997
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(96)00033-8
Related Items (55)
Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs ⋮ A near-exact method for solving the log-truck scheduling problem ⋮ An exact algorithm for an integrated project staffing problem with a homogeneous workforce ⋮ Column generation for a UAV assignment problem with precedence constraints ⋮ Optimal allocation of emergency medical resources in a mass casualty incident: patient prioritization by column generation ⋮ Circulation of railway rolling stock: a branch-and-price approach ⋮ The generalized fixed-charge network design problem ⋮ A constraint programming based column generation approach to nurse rostering problems ⋮ A branch and price approach for deployment of multi-tier software services in clouds ⋮ Composite-variable modeling for service parts logistics ⋮ Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems ⋮ A hub location problem with fully interconnected backbone and access networks ⋮ Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity ⋮ Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time ⋮ Multi-period traffic routing in satellite networks ⋮ Designing WDM optical networks using branch-and-price ⋮ Flexible weekly tour scheduling for postal service workers using a branch and price ⋮ A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops ⋮ Application of decomposition techniques in a wildfire suppression optimization model ⋮ Scheduling trainees at a hospital department using a branch-and-price approach ⋮ A stabilized column generation scheme for the traveling salesman subtour problem ⋮ A Branch and Price algorithm for the \(k\)-splittable maximum flow problem ⋮ Pruning in column generation for service vehicle dispatching ⋮ Solving the maximum edge biclique packing problem on unbalanced bipartite graphs ⋮ A column generation approach for the split delivery vehicle routing problem ⋮ Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function ⋮ A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals ⋮ Exact algorithms for the matrix bid auction ⋮ Group-scheduling problems in electronics manufacturing ⋮ A branch-and-price approach for integrating nurse and surgery scheduling ⋮ Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling ⋮ Exact approaches for integrated aircraft fleeting and routing at TunisAir ⋮ Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem ⋮ A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes ⋮ A hybrid scatter search heuristic for personalized crew rostering in the airline industry ⋮ A nested column generation algorithm to the meta slab allocation problem in the steel making industry ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition ⋮ The shortest path problem with forbidden paths ⋮ Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems ⋮ Sequencing surgical cases in a day-care environment: an exact branch-and-price approach ⋮ Fleet assignment and routing with schedule synchronization constraints ⋮ A novel modeling approach for express package carrier planning ⋮ Column-Generation in Integer Linear Programming ⋮ Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem ⋮ Branch and Price for Chance-Constrained Bin Packing ⋮ Solving a dial-a-flight problem using composite variables ⋮ A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems ⋮ A generalized linear programming model for nurse scheduling ⋮ Using Column Generation to Solve a Coal Blending Problem ⋮ Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem ⋮ LP models for bin packing and cutting stock problems ⋮ An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems ⋮ On compact formulations for integer programs solved by column generation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Min-cut clustering
- Solving binary cutting stock problems by column generation and branch- and-bound
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms
- A Column-Generation Based Tactical Planning Method for Inventory Routing
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
- A Linear Programming Approach to the Cutting Stock Problem—Part II
This page was built for publication: An exact algorithm for IP column generation
