An exact algorithm for IP column generation
From MaRDI portal
Publication:1360108
DOI10.1016/0167-6377(96)00033-8zbMATH Open0873.90074OpenAlexW2013479503MaRDI QIDQ1360108FDOQ1360108
Laurence A. Wolsey, F. 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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Linear Programming Approach to the Cutting-Stock Problem
- Branch-and-price: Column generation for solving huge integer programs
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Decomposition Principle for Linear Programs
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Min-cut clustering
- Solving binary cutting stock problems by column generation and branch- and-bound
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
- A column-generation based tactical planning method for inventory routing
- Optimal placement of add/drop multiplexers: Heuristic and exact algorithms
- A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
Cited In (55)
- Using Column Generation to Solve a Coal Blending Problem
- 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
- Column generation for a UAV assignment problem with precedence constraints
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- Exact approaches for integrated aircraft fleeting and routing at TunisAir
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- Branch and Price for Chance-Constrained Bin Packing
- An exact algorithm for an integrated project staffing problem with a homogeneous workforce
- A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals
- Designing WDM optical networks using branch-and-price
- Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem
- A hybrid scatter search heuristic for personalized crew rostering in the airline industry
- Column-Generation in Integer Linear Programming
- A column generation approach for the split delivery vehicle routing problem
- A generalized linear programming model for nurse scheduling
- Optimal allocation of emergency medical resources in a mass casualty incident: patient prioritization by column generation
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
- A nested column generation algorithm to the meta slab allocation problem in the steel making industry
- A Branch and Price algorithm for the \(k\)-splittable maximum flow problem
- LP models for bin packing and cutting stock problems
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity
- A constraint programming based column generation approach to nurse rostering problems
- Fleet assignment and routing with schedule synchronization constraints
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
- Flexible weekly tour scheduling for postal service workers using a branch and price
- Multi-period traffic routing in satellite networks
- Composite-variable modeling for service parts logistics
- A stabilized column generation scheme for the traveling salesman subtour problem
- Group-scheduling problems in electronics manufacturing
- Sequencing surgical cases in a day-care environment: an exact branch-and-price approach
- The shortest path problem with forbidden paths
- A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
- A branch and price approach for deployment of multi-tier software services in clouds
- Pruning in column generation for service vehicle dispatching
- On compact formulations for integer programs solved by column generation
- Scheduling trainees at a hospital department using a branch-and-price approach
- The generalized fixed-charge network design problem
- A hub location problem with fully interconnected backbone and access networks
- A branch-and-price approach for integrating nurse and surgery scheduling
- A near-exact method for solving the log-truck scheduling problem
- Exact algorithms for the matrix bid auction
- A novel modeling approach for express package carrier planning
- Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition
- Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
- Circulation of railway rolling stock: a branch-and-price approach
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
- Solving a dial-a-flight problem using composite variables
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
- Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling
- A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems
This page was built for publication: An exact algorithm for IP column generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1360108)
