Lagrangean decomposition for integer programming : theory and applications
From MaRDI portal
Recommendations
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- scientific article; zbMATH DE number 4053350
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- Lagrangean Decomposition In Integer Linear Programming: A New Scheme
- Decomposition in integer linear programming
Cited in
(36)- Lagrangean decomposition for integer nonlinear programming with linear constraints
- A decomposition technique for mixed integer programming problems
- Solving makespan minimization problems with Lagrangean decomposition
- The return plant location problem: Modelling and resolution
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- A Lagrangean decomposition solution to a single line multiproduct scheduling problem
- A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
- Polyhedral analysis and decompositions for capacitated plant location-type problems
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
- Dantzig-Wolfe and Lagrangian decompositions in integer linear programming
- Facility location with increasing production costs
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
- Decomposition of loosely coupled integer programs: a multiobjective perspective
- \(\gamma\)-robust facility relocation problem
- A primal-proximal heuristic applied to the French unit-commitment problem
- A novel analytical integer optimization method for wavelet based subband coding
- Lagrangian decomposition via sub-problem search
- scientific article; zbMATH DE number 5506108 (Why is no real title available?)
- scientific article; zbMATH DE number 3898614 (Why is no real title available?)
- scientific article; zbMATH DE number 3976783 (Why is no real title available?)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- scientific article; zbMATH DE number 4053350 (Why is no real title available?)
- Lagrangean Decomposition In Integer Linear Programming: A New Scheme
- scientific article; zbMATH DE number 3628723 (Why is no real title available?)
- scientific article; zbMATH DE number 1062478 (Why is no real title available?)
- scientific article; zbMATH DE number 1450264 (Why is no real title available?)
- scientific article; zbMATH DE number 5165610 (Why is no real title available?)
- An homage to Joseph-Louis Lagrange and Pierre Huard
- The multi-hour service system design problem
- pth power Lagrangian method for integer programming
- Integrated operating room scheduling and surgical instrument inventory management: models, algorithms, and cost-saving insights
- A comparison of heuristics and relaxations for the capacitated plant location problem
- About Lagrangian methods in integer optimization
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
- Improved Lagrangean decomposition: An application to the generalized assignment problem
This page was built for publication: Lagrangean decomposition for integer programming : theory and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780006)