On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
From MaRDI portal
Publication:4530641
Recommendations
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- Dantzig-Wolfe and Lagrangian decompositions in integer linear programming
- Decomposition Branching for Mixed Integer Programming
- On Integer Programming and the Branch-Width of the Constraint Matrix
- Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A branch and bound algorithm for solving separable convex integer programming problems
- A branch and bound algorithm for solving a class of nonlinear integer programming problems
Cited in
(89)- An inexact bundle variant suited to column generation
- A framework for collaborative planning and state-of-the-art
- On column generation formulations for the RWA problem
- A unified approach for price directive decomposition procedures in integer programming
- A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine
- Branch-and-price algorithm for fuzzy integer programming problems with block angular structure
- Decomposition techniques with mixed integer programming and heuristics for home healthcare planning
- A new cross decomposition method for stochastic mixed-integer linear programming
- Sequential testing of n-out-of-n systems: precedence theorems and exact methods
- Dantzig-Wolfe and Lagrangian decompositions in integer linear programming
- LP models for bin packing and cutting stock problems
- Multi-period traffic routing in satellite networks
- A branch-and-price algorithm for the minimum sum coloring problem
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
- A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
- Solving robust bin-packing problems with a branch-and-price approach
- New exact techniques applied to a class of network flow formulations
- Decomposition of loosely coupled integer programs: a multiobjective perspective
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
- Dynamic location of modular manufacturing facilities with relocation of individual modules
- A graph partitioning strategy for solving large-scale crew scheduling problems
- A column generation approach to multiscale capacity planning for power-intensive process networks
- Circulation of railway rolling stock: a branch-and-price approach
- An exact algorithm for parallel machine scheduling with conflicts
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- Scheduling trainees at a hospital department using a branch-and-price approach
- Converging upon basic feasible solutions through Dantzig-Wolfe decomposition
- On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem
- A branch-and-price approach for integrating nurse and surgery scheduling
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- A branch-and-price-and-cut approach for sustainable crop rotation planning
- Column generation based heuristic for tactical planning in multi-period vehicle routing
- Models and algorithms for three-stage two-dimensional bin packing
- A new branch-and-price algorithm for the traveling tournament problem
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- Simultaneously exploiting two formulations: an exact Benders decomposition approach
- On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage
- Exact solution of network flow models with strong relaxations
- Branch-and-price: Column generation for solving huge integer programs
- Dual inequalities for stabilized column generation revisited
- An exact algorithm for an integrated project staffing problem with a homogeneous workforce
- Irregular polyomino tiling via integer programming with application in phased array antenna design
- Branch-and-price and constraint programming for solving a real-life technician dispatching problem
- Cutting planes for branch-and-price algorithms
- A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes
- Optimal allocation of emergency medical resources in a mass casualty incident: patient prioritization by column generation
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Hybrid column generation for large-size covering integer programs: application to transportation planning
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- Decomposition in integer linear programming
- Branch and Price for Chance-Constrained Bin Packing
- Optimized load planning for motorail transportation
- A branch and price approach for deployment of multi-tier software services in clouds
- Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- Reformulation and decomposition of integer programs
- A stabilized structured Dantzig-Wolfe decomposition method
- Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems
- Flexible weekly tour scheduling for postal service workers using a branch and price
- Elective course planning
- Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems
- Column-Generation in Integer Linear Programming
- Analysis of programming properties and the row-column generation method for 1-norm support vector machines
- Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization
- Consistency cuts for Dantzig-Wolfe reformulations
- Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines
- Using column generation to solve a coal blending problem
- Modeling and solving vehicle routing problems with many available vehicle types
- Selected Topics in Column Generation
- A column generation approach for the split delivery vehicle routing problem
- The omnipresence of Lagrange
- A hybrid robust-stochastic optimization approach for day-ahead scheduling of cascaded hydroelectric system in restructured electricity market
- Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm
- A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
- A tutorial on column generation and branch-and-price for vehicle routing problems
- Branching in branch-and-price: A generic scheme
- A modeling and hybridized decomposition approach for the multi-level capacitated lot-sizing problem with setup carryover, backlogging, and emission control
- Column generation for multistage stochastic mixed-integer nonlinear programs with discrete state variables
- Interior point methods in the year 2025
- A bay design problem in less-than-unit-load production warehouse
- Last fifty years of integer linear programming: a focus on recent practical advances
- Solving large-scale capital budgeting problems with column generation and optimization-based sorting
- An efficient two-stage column generation algorithm for solving large-scale unit commitment
- On compact formulations for integer programs solved by column generation
- Composite-variable modeling for service parts logistics
- Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem
- A branch-and-price algorithm for an integrated production and inventory routing problem
- A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool
This page was built for publication: On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530641)