Pages that link to "Item:Q2366611"
From MaRDI portal
The following pages link to A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611):
Displaying 15 items.
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209) (← links)
- A note on algebraic expressions of rhomboidal labeled graphs (Q324971) (← links)
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
- On algebraic expressions of directed grid graphs (Q1687836) (← links)
- Single machine scheduling with a generalized job-dependent cumulative effect (Q1702657) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- Avoiding bad steps in Frank-Wolfe variants (Q2111475) (← links)
- On lengths of edge-labeled graph expressions (Q2161278) (← links)
- Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs (Q2357161) (← links)
- Scaling, proximity, and optimization of integrally convex functions (Q2414902) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives (Q2817799) (← links)
- MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK (Q3569281) (← links)
- On a Reduction for a Class of Resource Allocation Problems (Q5087712) (← links)
