Pages that link to "Item:Q1149883"
From MaRDI portal
The following pages link to On the choice of step size in subgradient optimization (Q1149883):
Displaying 30 items.
- Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints (Q320925) (← links)
- Modelling and planning public cultural schedules for efficient use of resources (Q337501) (← links)
- An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
- Two-direction subgradient method for non-differentiable optimization problems (Q581239) (← links)
- Mixed-integer bilinear programming problems (Q687032) (← links)
- Level bundle-like algorithms for convex optimization (Q743968) (← links)
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory (Q747754) (← links)
- Cross decomposition applied to the stochastic transportation problem (Q799587) (← links)
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem (Q811344) (← links)
- Convergence and computational analyses for some variable target value and subgradient deflection methods (Q853561) (← links)
- A Lagrangian relaxation approach to large-scale flow interception problems (Q1026763) (← links)
- A comparison of two dual-based procedures for solving the p-median problem (Q1058960) (← links)
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs (Q1110459) (← links)
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
- Variable target value subgradient method (Q1174455) (← links)
- A Langrangean heuristic for the \(p_ k\)-median dynamic location problem (Q1194737) (← links)
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem (Q1290717) (← links)
- Capacity analysis in repetitive assemble-to-order manufacturing systems (Q1342003) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- On some difficult linear programs coming from set partitioning (Q1348247) (← links)
- Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs (Q1584813) (← links)
- An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
- A primal-dual subgradient method for time staged capacity expansion planning (Q1820669) (← links)
- A variable target value method for nondifferentiable optimization (Q1970420) (← links)
- An inexact modified subgradient algorithm for nonconvex optimization (Q2268922) (← links)
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806) (← links)
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian (Q2494475) (← links)
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods (Q2995265) (← links)
- A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem (Q6164630) (← links)
