Lagrangian relaxation of the generic materials and operations planning model
From MaRDI portal
Publication:2303321
DOI10.1007/s10100-018-0593-0OpenAlexW2899851694MaRDI QIDQ2303321
J. Maheut, Jairo R. Coronado-Hernandez, G. Rius-Sorolla, Jose P. Garcia-Sabater
Publication date: 3 March 2020
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11323/1646
Related Items (2)
Or in the industrial engineering of industry 4.0: experiences from the Iberian Peninsula mirrored in CJOR ⋮ Special issue: engineering digital transformation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process
- An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem
- Accelerated gradient methods and dual decomposition in distributed model predictive control
- Use of Lagrangian decomposition in supply chain planning
- Economic lot scheduling with deliberated and controlled coproduction
- An augmented Lagrangian relaxation for analytical target cascading using the alternating direction method of multipliers
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
- On solving the Lagrangian dual of integer programs via an incremental approach
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- Comments on ``Surrogate gradient algorithm for Lagrangian relaxation
- Partitioning procedures for solving mixed-variables programming problems
- Surrogate duality relaxation for job shop scheduling
- Convexification procedures and decomposition methods for nonconvex optimization problems
- Surrogate gradient algorithm for Lagrangian relaxation
- The volume algorithm: Producing primal solutions with a subgradient method
- Lagrangean/surrogate relaxation for generalized assignment problems
- Lagrangean relaxation. (With comments and rejoinder).
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
- A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time
- Decomposition Principle for Linear Programs
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Computational Complexity of the Capacitated Lot Size Problem
- Note on a method of conjugate subgradients for minimizing nondifferentiable functions
- On convergence rates of subgradient optimization methods
- Validation of subgradient optimization
- Coordination between strategic forest management and tactical logistic and production planning in the forestry supply chain
- Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Minimization of unsmooth functionals
- The traveling-salesman problem and minimum spanning trees: Part II
- The Relaxation Method for Linear Inequalities
- The Lagrange Multiplier Rule for Two Dependent and Two Independent Variables
- A Lagrangian based branch-and-bound algorithm for production-transportation problems
- Unit commitment by augmented Lagrangian relaxation: testing two decomposition approaches
This page was built for publication: Lagrangian relaxation of the generic materials and operations planning model
