The following pages link to (Q3968758):
Displayed 50 items.
- An efficient method for nonlinearly constrained networks (Q706946) (← links)
- A discrete vector potential model for unsteady incompressible viscous flows (Q749361) (← links)
- Modeling the satellite placement problem as a network flow problem with one side constraint (Q751497) (← links)
- Multicommodity flows in certain planar directed networks (Q753654) (← links)
- A polynomial algorithm for minimum quadratic cost flow problems (Q761341) (← links)
- Network models for vehicle and crew scheduling (Q792872) (← links)
- On large scale nonlinear network optimization (Q908858) (← links)
- Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations (Q908860) (← links)
- The structure of bases in bicircular matroids (Q912110) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- A network-related nuclear power plant model with an intelligent branch- and-bound solution approach (Q917441) (← links)
- A modeling/solution approach for optimal deployment of a weapons arsenal (Q918402) (← links)
- The auction algorithm for the transportation problem (Q918416) (← links)
- Parallel arc-allocation algorithms for optimizing generalized networks (Q918433) (← links)
- Network reoptimization procedures for multiobjective network problems (Q918434) (← links)
- Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
- An application of dynamic modeling to the sea shore rotation planning problem in the Navy (Q922332) (← links)
- Solution of large dense transportation problems using a parallel primal algorithm (Q922946) (← links)
- On the complexity of recognizing a class of generalized networks (Q1058995) (← links)
- Reoptimization procedures for bounded variable primal simplex network algorithms (Q1066818) (← links)
- Representing inverses in pure network flow optimization (Q1068691) (← links)
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm (Q1068720) (← links)
- Spatial market equilibrium problems as network models (Q1072912) (← links)
- Computational experience with a polynomial-time dual simplex algorithm for the transportation problem (Q1072935) (← links)
- A variable-dimension homotopy on networks for computing linear spatial equilibria (Q1077331) (← links)
- Modeling of building evacuation problems by network flows with side constraints (Q1098760) (← links)
- Network flow problems with one side constraint: A comparison of three solution methods (Q1102172) (← links)
- An extension of the König-Egerváry property to node-weighted bidirected graphs (Q1108202) (← links)
- Bounds on penalties for dummy arcs in transportation networks (Q1117136) (← links)
- Subspaces with well-scaled frames (Q1122483) (← links)
- Fuzzy multi-level minimum cost flow problems (Q1125334) (← links)
- Assignment of tools to machines in a flexible manufacturing system (Q1130034) (← links)
- A note on the performance of limited entry queuing systems (Q1169395) (← links)
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations (Q1169409) (← links)
- A network penalty method (Q1174423) (← links)
- An algorithm for solving quadratic network flow problems (Q1175149) (← links)
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem (Q1176566) (← links)
- Structural properties of the progressive hedging algorithm (Q1176858) (← links)
- Representations of bicircular matroids (Q1179188) (← links)
- Multi-stage stochastic optimization applied to energy planning (Q1181742) (← links)
- Computational results of an interior point algorithm for large scale linear programming (Q1181915) (← links)
- Routing flexibility and production scheduling in a flexible manufacturing system (Q1199517) (← links)
- A diagonal quadratic approximation method for large scale linear programs (Q1200793) (← links)
- Recognizing hidden bicircular networks (Q1208462) (← links)
- A min-max resource allocation problem with substitutions (Q1262219) (← links)
- Detecting embedded pure network structures in LP problems (Q1265245) (← links)
- Optimal expansion of capacitated transshipment networks (Q1266668) (← links)
- An implementation of linear and nonlinear multicommodity network flows (Q1268228) (← links)
- Algorithms for network piecewise-linear programs: A comparative study (Q1278601) (← links)
- Multifleet routing and multistop flight scheduling for schedule perturbation (Q1280131) (← links)