Surrogate gradient algorithm for Lagrangian relaxation
From MaRDI portal
Publication:1289401
DOI10.1023/A:1022646725208zbMath0949.90065MaRDI QIDQ1289401
Publication date: 28 November 2000
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022646725208
Related Items
Projection algorithms with dynamic stepsize for constrained composite minimization, Reverse auction-based job assignment among foundry fabs, An adaptive approach to adjust constraint bounds and its application in structural topology optimization, Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation, New Lagrangian relaxation based algorithm for resource scheduling with homogeneous subproblems, New bundle methods for solving Lagrangian relaxation dual problems, Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness, 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, Scheduling of design projects with uncertain number of iterations, Scheduling job shops with batch machines using the Lagrangian relaxation technique, An alternative framework to Lagrangian relaxation approach for job shop scheduling., On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point 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, 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, Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems, A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production, COLLABORATIVE PLANNING IN SUPPLY CHAINS BY LAGRANGIAN RELAXATION AND GENETIC ALGORITHMS
Cites Work
