The following pages link to (Q3730336):
Displayed 50 items.
- The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate (Q672389) (← links)
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- A primal-dual simplex method for linear programs (Q688212) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Quadratic cost flow and the conjugate gradient method (Q707094) (← links)
- Benefit sharing in holding situations (Q707151) (← links)
- Optimal control on a graph with application to train scheduling problems (Q753655) (← links)
- Railway scheduling by network optimization (Q753674) (← links)
- Edge-directions of standard polyhedra with applications to network flows (Q811875) (← links)
- Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm (Q868125) (← links)
- Optimal scaling of a gradient method for distributed resource allocation (Q868539) (← links)
- Canonical bases in linear programming (Q908850) (← links)
- Relaxation methods for monotropic programs (Q909583) (← links)
- Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem (Q910459) (← links)
- The auction algorithm for the transportation problem (Q918416) (← links)
- A Z-simplex algorithm with partial updates (Q1097835) (← links)
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy (Q1110457) (← links)
- Sublinear upper bounds for stochastic programs with recourse (Q1115346) (← links)
- Dual coordinate step methods for linear network flow problems (Q1115790) (← links)
- Geometric interpretation of the optimality conditions in multifacility location and applications (Q1120460) (← links)
- An algorithm for solving quadratic network flow problems (Q1175149) (← links)
- Decomposition algorithm for convex differentiable minimization (Q1176837) (← links)
- A dual algorithm for submodular flow problems (Q1183393) (← links)
- On the convergence of the affine-scaling algorithm (Q1196183) (← links)
- Characterizations of max-balanced flows (Q1201811) (← links)
- Auction algorithms for network flow problems: A tutorial introduction (Q1202585) (← links)
- On the dual coordinate ascent approach for nonlinear networks (Q1207203) (← links)
- When facilities coincide: Exact optimality conditions in multifacility location (Q1209505) (← links)
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623) (← links)
- A practical anti-cycling procedure for linearly constrained optimization (Q1264089) (← links)
- Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems (Q1265014) (← links)
- Minimizing waiting times in integrated fixed interval timetables by upgrading railway tracks (Q1280194) (← links)
- Discrete convex analysis (Q1290668) (← links)
- The empirical performance of a polynomial algorithm for constrained nonlinear optimization (Q1309871) (← links)
- On degeneracy in linear programming and related problems (Q1312772) (← links)
- A generic auction algorithm for the minimum cost network flow problem (Q1315446) (← links)
- Parallel primal-dual methods for the minimum cost flow problem (Q1315451) (← links)
- The auction algorithm: A distributed relaxation method for the assignment problem (Q1320412) (← links)
- Descent methods for convex essentially smooth minimization (Q1321119) (← links)
- Piecewise lexicographic programming: A new model for practical decision problems (Q1321139) (← links)
- Parallel alternating direction multiplier decomposition of convex programs (Q1321443) (← links)
- Multicommodity network flows: The impact of formulation on decomposition (Q1321667) (← links)
- The facets of the polyhedral set determined by the Gale-Hoffman inequalities (Q1321672) (← links)
- Data parallel computing for network-structured optimization problems (Q1328430) (← links)
- A decomposition approach for a resource constrained scheduling problem (Q1333515) (← links)
- A generator and a simplex solver for network piecewise linear programs (Q1335389) (← links)
- On the equivalence of constrained and unconstrained flows (Q1339398) (← links)
- Optimal objective function approximation for separable convex quadratic programming (Q1340073) (← links)
- A faster version of the ASG algorithm (Q1343522) (← links)
- A strongly polynomial algorithm for the minimum cost tension problem (Q1356759) (← links)