Pages that link to "Item:Q816571"
From MaRDI portal
The following pages link to Complexity and algorithms for convex network optimization and other nonlinear problems (Q816571):
Displaying 21 items.
- Algorithmic problems of nontransitive (SSB) utilities (Q808974) (← links)
- On total variation minimization and surface evolution using parametric maximum flows (Q847514) (← links)
- On large scale nonlinear network optimization (Q908858) (← links)
- Optimal procedures and complexity analyses of nonserial converging branch networks (Q918445) (← links)
- Optimization algorithms for a class of nonlinear programming problems (Q1105491) (← links)
- Surveys in operations research (Q1730527) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- Error minimization methods in biproportional apportionment (Q1939088) (← links)
- Optimal deterministic and robust selection of electricity contracts (Q2124812) (← links)
- Eleven surveys in operations research (Q2480255) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- Twelve surveys in operations research (Q2630815) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- Lower and upper bounds for the non-linear generalized assignment problem (Q2664280) (← links)
- Network design applications of the class of column generation/simplicial decomposition algorithms in convex differentiable optimization (Q2783479) (← links)
- Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment (Q2892156) (← links)
- (Q3160178) (← links)
- Nonconvex Optimization for Communication Networks (Q3565466) (← links)
- (Q3763915) (← links)
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems (Q4302594) (← links)
- (Q4791242) (← links)
