scientific article; zbMATH DE number 1062478
From MaRDI portal
Publication:4354953
Recommendations
- Dantzig-Wolfe and Lagrangian decompositions in integer linear programming
- scientific article; zbMATH DE number 2154248
- Lagrangean decomposition for integer programming : theory and applications
- A stabilized structured Dantzig-Wolfe decomposition method
- Decomposition and dynamic cut generation in integer linear programming
Cited in
(36)- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
- A branch-and-price algorithm for the aperiodic multi-period service scheduling problem
- Exact approaches for solving a covering problem with capacitated subtrees
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- A column generation heuristic for optimal wireless sensor network design with mobile sinks
- Sequential testing of n-out-of-n systems: precedence theorems and exact methods
- Dantzig-Wolfe and Lagrangian decompositions in integer linear programming
- Lagrangean relaxation. (With comments and rejoinder).
- Column generation for vehicle routing problems with multiple synchronization constraints
- On generalized surrogate duality in mixed-integer nonlinear programming
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- An exact approach for the personnel task rescheduling problem with task retiming
- Coherent weights for pairwise comparison matrices and a mixed-integer linear programming problem
- A lexicographic pricer for the fractional bin packing problem
- A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example
- Lower and upper bounds for a two-stage capacitated facility location problem with handling costs
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- Large-scale optimization with the primal-dual column generation method
- A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production
- scientific article; zbMATH DE number 411827 (Why is no real title available?)
- Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce
- Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks
- A stabilized structured Dantzig-Wolfe decomposition method
- Column generation for extended formulations
- Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- Stabilizing branch-and-price for constrained tree problems
- Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- A branch-and-price algorithm for energy aware task scheduling of constellations of nanosatellites
- A machine learning approach to rank pricing problems in branch-and-price
- Chebyshev center based column generation
- Solving the minimum convex partition of point sets with integer programming
- A branch-and-price algorithm for the capacitated facility location problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354953)
