Pages that link to "Item:Q706946"
From MaRDI portal
The following pages link to An efficient method for nonlinearly constrained networks (Q706946):
Displaying 20 items.
- PFNRN (Q17314) (← links)
- A surrogate and Lagrangian approach to constrained network problems (Q920831) (← links)
- A method of network programming in problems of nonlinear optimization (Q1042678) (← links)
- Performance evaluation of independent superbasic sets on nonlinear replicated networks (Q1068689) (← links)
- On the dual coordinate ascent approach for nonlinear networks (Q1207203) (← links)
- A hybrid algorithm for solving network flow problems with side constraints. (Q1406684) (← links)
- An implementation of Newton-like methods on nonlinearly constrained networks (Q1765533) (← links)
- Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods (Q2429403) (← links)
- Approximate subgradient methods for nonlinearly constrained network flow problems (Q2499376) (← links)
- (Q3033210) (← links)
- (Q3139149) (← links)
- A motivation for using the truncated Newton approach in a very large scale nonlinear network problem (Q3713879) (← links)
- (Q3763915) (← links)
- (Q3786030) (← links)
- OR Practice—Large-Scale Nonlinear Network Models and Their Application (Q3823391) (← links)
- (Q3827812) (← links)
- An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons (Q4022698) (← links)
- A combinatorial method for computing bounds on solutions of active non‐linear resistive networks (Q4519079) (← links)
- (Q5202858) (← links)
- A set of connection network synthesis based on the linear Diophantine constraints solution in area {0,1} (Q5500393) (← links)