Surrogate gradient algorithm for Lagrangian relaxation
From MaRDI portal
Recommendations
Cites work
- Efficient generalized conjugate gradient algorithms. I: Theory
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3557512 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- Surrogate duality in a branch-and-bound procedure for integer programming
Cited in
(33)- Scheduling of design projects with uncertain number of iterations
- Scheduling job shops with batch machines using the Lagrangian relaxation technique
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- On the convergence of conditional -subgradient methods for convex programs and convex-concave saddle-point problems.
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- Stochastic programming for qualification management of parallel machines in semiconductor manufacturing
- An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation
- Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem
- Accelerating the convergence of subgradient optimisation
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0-1 optimization problems with linear constraints
- Convergence of the surrogate Lagrangian relaxation method
- Lagrangian relaxation of the generic materials and operations planning model
- A new model and hybrid approach for large scale inventory routing problems
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems
- An adaptive approach to adjust constraint bounds and its application in structural topology optimization
- A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production
- Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation
- COLLABORATIVE PLANNING IN SUPPLY CHAINS BY LAGRANGIAN RELAXATION AND GENETIC ALGORITHMS
- Approximate subgradient methods for Lagrangian relaxations on networks
- Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems
- Projection algorithms with dynamic stepsize for constrained composite minimization
- Reverse auction-based job assignment among foundry fabs
- Accelerating level-value adjustment for the Polyak stepsize
- New Lagrangian relaxation based algorithm for resource scheduling with homogeneous subproblems
- New bundle methods for solving Lagrangian relaxation dual problems
- A joint scheduling approach for production and material handling under customized manufacturing paradigm
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach
- Comments on ``Surrogate gradient algorithm for Lagrangian relaxation
- On the surrogate gradient algorithm for Lagrangian relaxation
- Optimization of R\&D project portfolios under endogenous uncertainty
This page was built for publication: Surrogate gradient algorithm for Lagrangian relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1289401)
