scientific article; zbMATH DE number 1062478
From MaRDI portal
Publication:4354953
zbMATH Open0886.90107MaRDI QIDQ4354953FDOQ4354953
Authors: Paul Wentges 
Publication date: 17 September 1997
Title of this publication is not available (Why is that?)
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 (34)
- Solving the minimum convex partition of point sets with integer programming
- Stabilizing branch-and-price for constrained tree problems
- Large-scale optimization with the primal-dual column generation method
- A stabilized structured Dantzig-Wolfe decomposition method
- Dantzig-Wolfe and Lagrangian decompositions in integer linear programming
- Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- On generalized surrogate duality in mixed-integer nonlinear programming
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- A lexicographic pricer for the fractional bin packing problem
- An exact approach for the personnel task rescheduling problem with task retiming
- Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods
- A branch-and-price algorithm for the capacitated facility location problem
- Coherent weights for pairwise comparison matrices and a mixed-integer linear programming problem
- Column generation for extended formulations
- 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
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- Title not available (Why is that?)
- Chebyshev center based column generation
- Lagrangean relaxation. (With comments and rejoinder).
- A column generation heuristic for optimal wireless sensor network design with mobile sinks
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
- Column generation for vehicle routing problems with multiple synchronization constraints
- Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm
- Lower and upper bounds for a two-stage capacitated facility location problem with handling costs
- A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example
- A branch-and-price algorithm for the aperiodic multi-period service scheduling problem
- Exact approaches for solving a covering problem with capacitated subtrees
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
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)
