Pages that link to "Item:Q3716775"
From MaRDI portal
The following pages link to Solving integer minimum cost flows with separable convex cost objective polynomially (Q3716775):
Displaying 31 items.
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
- A polynomial algorithm for minimum quadratic cost flow problems (Q761341) (← links)
- A polynomial algorithm for an integer quadratic non-separable transportation problem (Q1198737) (← links)
- Discrete convex analysis (Q1290668) (← links)
- A capacity scaling algorithm for convex cost submodular flows (Q1363412) (← links)
- Scheduling for electricity cost in a smart grid (Q1702731) (← links)
- Use of primal-dual technique in the network algorithm for two-way contingency tables (Q1774297) (← links)
- A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem (Q1889860) (← links)
- Error minimization methods in biproportional apportionment (Q1939088) (← links)
- Optimal deterministic and robust selection of electricity contracts (Q2124812) (← links)
- Computation and efficiency of potential function minimizers of combinatorial congestion games (Q2235157) (← links)
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743) (← links)
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
- Preemptive benchmarking problem: An approach for official statistics in small areas (Q2378486) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- Maximum network flows with concave gains (Q2492702) (← links)
- Permutohedra and minimal matrices (Q2576235) (← links)
- Local optimality conditions for multicommodity flow problems with separable piecewise convex costs (Q2643798) (← links)
- A polynomial-time descent method for separable convex optimization problems with linear constraints (Q2802141) (← links)
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q2817799) (← links)
- A polynomial combinatorial algorithm for generalized minimum cost flow (Q2819530) (← links)
- Scheduling for Electricity Cost in Smart Grid (Q2867129) (← links)
- Network flow methods for electoral systems (Q2892147) (← links)
- Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment (Q2892156) (← links)
- Solving the Convex Cost Integer Dual Network Flow Problem (Q3114859) (← links)
- A capacity scaling algorithm for the constrained maximum flow problem (Q4698231) (← links)
- Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
- Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm (Q5219680) (← links)
- Disruption management in production planning (Q5318284) (← links)
- Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q5415463) (← links)
- Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations (Q6140717) (← links)
