Pages that link to "Item:Q4342969"
From MaRDI portal
The following pages link to A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows (Q4342969):
Displaying 21 items.
- Dual subgradient method with averaging for optimal resource allocation (Q723992) (← links)
- Integer equal flows (Q833591) (← links)
- Two ``well-known'' properties of subgradient optimization (Q1016352) (← links)
- An augmented Lagrangian approach to multi-commodity flow problems with conversions (Q1077322) (← links)
- LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions (Q1384428) (← links)
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. (Q1410305) (← links)
- An augmented Lagrangian algorithm for large scale multicommodity routing (Q1424783) (← links)
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
- A feasibility-ensured Lagrangian heuristic for general decomposable problems (Q2068837) (← links)
- Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
- A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints (Q2368115) (← links)
- A Lagrangean relaxation approach for the mixed-model flow line sequencing problem (Q2456653) (← links)
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows (Q2480971) (← links)
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem (Q2815470) (← links)
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints (Q3057143) (← links)
- Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities (Q3202104) (← links)
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM (Q3391969) (← links)
- An efficient lagrangean relaxation scheme for linear and integer equal flow problems (Q4224668) (← links)
- A dual scheme for traffic assignment problems (Q4375434) (← links)
- Ergodic convergence in subgradient optimization (Q4391290) (← links)
- (Q5382245) (← links)
