scientific article
From MaRDI portal
Publication:3968758
zbMath0502.90056MaRDI QIDQ3968758
Richard V. Helgason, Jeffrey L. Kennington
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
simplex methodtransportation problemassignment problemshortest path problemside constraintsmulticommodity network flowout-of-kilter algorithmmaximal flow problemconvex cost network flow problem
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items
Basis characterisation for linear multicommodity network programs, The invisible‐hand heuristic for origin‐destination integer multicommodity network flows, The online transportation problem, Experiments with a hybrid interior point/combinatorial approach for network flow problems, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, A comprehensive simplex-like algorithm for network optimization and perturbation analysis, A variable-dimension homotopy on networks for computing linear spatial equilibria, Solving a class of network models for dynamic flow control, A generator and a simplex solver for network piecewise linear programs, Recognizing a class of bicircular matroids, A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods, A transportation problem formulation for the MAC airlift planning problem, Multi-item capacitated lot-sizing by a cross decomposition based algorithm, Optimal inventory, backlogging and machine loading in a serial, multi-stage, multi-period production environment, Development and computational tests of an undecoupled optimum short-term hydro-thermal scheduling code using network flows, Modeling of building evacuation problems by network flows with side constraints, An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints, Network flow problems with one side constraint: A comparison of three solution methods, An algorithm for self-organization of driverless vehicles of a car-rental service, SOCRATES: A system for scheduling hydroelectric generation under uncertainty, An extension of the König-Egerváry property to node-weighted bidirected graphs, Design and Implementation of Data Structures for Generalized Networks, The singly constrained assignment problem: An AP basis algorithm, A linear model for compound multicommodity network flow problems, Bounds on penalties for dummy arcs in transportation networks, Flows on hypergraphs, An enhanced decomposition algorithm for multistage stochastic hydroelectric scheduling, Subspaces with well-scaled frames, Fuzzy multi-level minimum cost flow problems, Minimum-cost flow algorithms: an experimental evaluation, Assignment of tools to machines in a flexible manufacturing system, Automatic decrease of the penalty parameter in exact penalty function methods, Interdicting the activities of a linear program -- a parametric analysis, Network simplex algorithm for the general equal flow problem., Computational comparisons of dual conjugate gradient algorithms for strictly convex networks., A hybrid algorithm for solving network flow problems with side constraints., Minimal-cost network flow problems with variable lower bounds on arc flows, On large scale nonlinear network optimization, Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations, Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints., The structure of bases in bicircular matroids, A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows, A survey of dynamic network flows, A network-related nuclear power plant model with an intelligent branch- and-bound solution approach, A least-squares minimum-cost network flow algorithm, A modeling/solution approach for optimal deployment of a weapons arsenal, The auction algorithm for the transportation problem, Parallel arc-allocation algorithms for optimizing generalized networks, Network reoptimization procedures for multiobjective network problems, An integrated dispatching model for rail yards operations., Analysis of relaxations for the multi-item capacitated lot-sizing problem, An application of dynamic modeling to the sea shore rotation planning problem in the Navy, Solution of large dense transportation problems using a parallel primal algorithm, A note on the performance of limited entry queuing systems, Equivalent weights for lexicographic multi-objective programs: Characterizations and computations, A network penalty method, An algorithm for solving quadratic network flow problems, Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints, Use of dynamic trees in a network simplex algorithm for the maximum flow problem, Structural properties of the progressive hedging algorithm, The out‐of‐kilter algorithm for solving network problems, Representations of bicircular matroids, Multi-stage stochastic optimization applied to energy planning, Computational results of an interior point algorithm for large scale linear programming, RAMP algorithms for the capacitated facility location problem, Routing flexibility and production scheduling in a flexible manufacturing system, A diagonal quadratic approximation method for large scale linear programs, A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks, A partial linearization method for the traffic assignment problem, Recognizing hidden bicircular networks, An implementation of Newton-like methods on nonlinearly constrained networks, An efficient method for nonlinearly constrained networks, An algorithm for nonlinear programs over Cartesian product sets, Diseño de redes de intercambiadores de calor con utilidades multiples por programacion lineal, Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems, A forward/reverse auction algorithm for asymmetric assignment problems, A min-max resource allocation problem with substitutions, A discrete vector potential model for unsteady incompressible viscous flows, Detecting embedded pure network structures in LP problems, Optimal expansion of capacitated transshipment networks, Modeling the satellite placement problem as a network flow problem with one side constraint, Extending and solving a multiperiod congested network flow model, An implementation of linear and nonlinear multicommodity network flows, Multicommodity flows in certain planar directed networks, Solution of constrained generalized transportation problems using the pivot and probe algorithm, A polynomial algorithm for minimum quadratic cost flow problems, Algorithms for network piecewise-linear programs: A comparative study, Multifleet routing and multistop flight scheduling for schedule perturbation, Network models for vehicle and crew scheduling, The transportation problem with exclusionary side constraints and two branch-and-bound algorithms, An efficient lagrangean relaxation scheme for linear and integer equal flow problems, On the complexity of recognizing a class of generalized networks, A simplicial decomposition method for the transit equilibrium assignment problem, Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems, A unified framework for primal-dual methods in minimum cost network flow problems, A sequential quadratic programming-based algorithm for the optimization of gas networks, A generic auction algorithm for the minimum cost network flow problem, Reoptimization procedures for bounded variable primal simplex network algorithms, A passenger demand model for airline flight scheduling and fleet routing, Representing inverses in pure network flow optimization, The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm, Multicommodity network flows: The impact of formulation on decomposition, Spatial market equilibrium problems as network models, Computational experience with a polynomial-time dual simplex algorithm for the transportation problem, A tabu search heuristic procedure for the fixed charge transportation problem, A fuzzy set-based approach to origin-destination matrix estimation in urban traffic networks with imprecise data
