Pages that link to "Item:Q1289401"
From MaRDI portal
The following pages link to Surrogate gradient algorithm for Lagrangian relaxation (Q1289401):
Displaying 24 items.
- An adaptive approach to adjust constraint bounds and its application in structural topology optimization (Q289137) (← links)
- Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation (Q319939) (← links)
- New Lagrangian relaxation based algorithm for resource scheduling with homogeneous subproblems (Q700701) (← links)
- New bundle methods for solving Lagrangian relaxation dual problems (Q700752) (← links)
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness (Q733544) (← links)
- Comments on ``Surrogate gradient algorithm for Lagrangian relaxation'' (Q933830) (← links)
- On the surrogate gradient algorithm for Lagrangian relaxation (Q946317) (← links)
- Optimization of R\&D project portfolios under endogenous uncertainty (Q992625) (← links)
- Scheduling of design projects with uncertain number of iterations (Q1124816) (← links)
- Scheduling job shops with batch machines using the Lagrangian relaxation technique (Q1383473) (← links)
- An alternative framework to Lagrangian relaxation approach for job shop scheduling. (Q1399595) (← links)
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. (Q1410305) (← links)
- Stochastic programming for qualification management of parallel machines in semiconductor manufacturing (Q1652146) (← links)
- An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation (Q1695028) (← links)
- Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem (Q1752849) (← links)
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343) (← links)
- Convergence of the surrogate Lagrangian relaxation method (Q2260658) (← links)
- Lagrangian relaxation of the generic materials and operations planning model (Q2303321) (← links)
- A new model and hybrid approach for large scale inventory routing problems (Q2482782) (← links)
- Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems (Q2669540) (← links)
- A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production (Q3005835) (← links)
- COLLABORATIVE PLANNING IN SUPPLY CHAINS BY LAGRANGIAN RELAXATION AND GENETIC ALGORITHMS (Q3528990) (← links)
- Projection algorithms with dynamic stepsize for constrained composite minimization (Q5225430) (← links)
- Reverse auction-based job assignment among foundry fabs (Q5438631) (← links)
