Pages that link to "Item:Q3725834"
From MaRDI portal
The following pages link to An efficient implementation of the network simplex method (Q3725834):
Displayed 28 items.
- A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals (Q552189) (← links)
- A least-squares minimum-cost network flow algorithm (Q646641) (← links)
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses (Q699349) (← links)
- On large scale nonlinear network optimization (Q908858) (← links)
- \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows (Q909586) (← links)
- Parallel arc-allocation algorithms for optimizing generalized networks (Q918433) (← links)
- An exterior simplex type algorithm for the minimum cost network flow problem (Q958451) (← links)
- A decentralized coordination mechanism for integrated production-transportation-inventory problem in the supply chain using Lagrangian relaxation (Q1001384) (← links)
- Finding non-dominated solutions in bi-objective integer network flow problems (Q1010260) (← links)
- A primal-dual simplex algorithm for bi-objective network flow problems (Q1041407) (← links)
- Performance evaluation of independent superbasic sets on nonlinear replicated networks (Q1068689) (← links)
- A network penalty method (Q1174423) (← links)
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem (Q1176566) (← links)
- On the computational behavior of a polynomial-time network flow algorithm (Q1190598) (← links)
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
- An implementation of linear and nonlinear multicommodity network flows (Q1268228) (← links)
- A practical anti-degeneracy row selection technique in network linear programming (Q1312776) (← links)
- Solving a class of network models for dynamic flow control (Q1333519) (← links)
- A generator and a simplex solver for network piecewise linear programs (Q1335389) (← links)
- On strongly polynomial dual simplex algorithms for the maximum flow problem (Q1373745) (← links)
- Automatic decrease of the penalty parameter in exact penalty function methods (Q1388859) (← links)
- Infinite networks: Minimal cost flows (Q1921147) (← links)
- A linear model for compound multicommodity network flow problems (Q2654399) (← links)
- Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
- Numerical solutions of the mass transfer problem (Q3430943) (← links)
- The quickest flow problem (Q4031968) (← links)
- An exponential‐function reduction method for block‐angular convex programs (Q4894869) (← links)
- (Q4953319) (← links)