On some techniques useful for solution of transportation network problems
From MaRDI portal
Publication:5668591
DOI10.1002/net.3230010206zbMath0253.90015OpenAlexW2163318198MaRDI QIDQ5668591
Publication date: 1971
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230010206
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
Maximum and optimal 1-2 matching problem of the different kind, Distribution-free testing in linear and parametric regression, A shortest augmenting path algorithm for dense and sparse linear assignment problems, A very personal reminiscence on the problem of computational complexity, Efficient many-to-Many point matching in one dimension, Index Reduction via Unimodular Transformations, Primal-dual algorithms for the assignment problem, Linear-Time Approximation for Maximum Weight Matching, Local search heuristics for the mobile facility location problem, Computing the sequence of \(k\)-cardinality assignments, Penelope's graph: a hard minimum cost tension instance, Minimum-cost flow algorithms: an experimental evaluation, Shortest bibranchings and valuated matroid intersection, An algorithm for algebraic assignment problems, Fast primal-dual update against local weight update in linear assignment problem and its application, A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs, A survey on exact algorithms for the maximum flow and minimum‐cost flow problems, Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages, Transportation problems which can be solved by the use of hirsch-paths for the dual problems, On the stochastic complexity of the asymmetric traveling salesman problem, A linear assignment approach for the least-squares protein morphing problem, Efficiency and time-cost-tradeoffs in transportation problems, Topologically trivial closed walks in directed surface graphs, Rényi 100, quantitative and qualitative (in)dependence, Critical objective function values in linear sum assignment problems, A genuinely polynomial primal simplex algorithm for the assignment problem, Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors, Rangzuordnungsprobleme, An algorithm for ranking assignments using reoptimization, Lower bounds for symmetricK-peripatetic salesman problems, An augmenting path method for solving linear bottleneck assignment problems, Faster Algorithms for Semi-Matching Problems, On a pair of job-machine assignment problems with two stages, An augmenting path method for solving linear bottleneck transportation problems, An addendum on the incremental assignment problem, Authors' response to ``An addendum on the incremental assignment problem by Volgenant, A comparison of two algorithms for the assignment problem, An algorithm for then×n optimum assignment problem, Improving the approximation ratio for capacitated vehicle routing, Approximating the discrete time-cost tradeoff problem with bounded depth, Min-Cost Flow in Unit-Capacity Planar Graphs, Testing the necklace condition for shortest tours and optimal factors in the plane, An efficient algorithm for minimum-weight bibranching, On dual solutions of the linear assignment problem, Distribution-free and model-free multivariate feature screening via multivariate rank distance correlation, Linear and semi-assignment problems: A core oriented approach, Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices, Generalized lexicographically optimal flows in networks with multiple sources and sinks, The optimum assignments and a new heuristic approach for the traveling salesman problem, Unnamed Item, Unnamed Item, Upper bounds on number of steals in rooted trees, A bad network problem for the simplex method and other minimum cost flow algorithms, Linear assignment procedures, Network flow methods for the minimum covariate imbalance problem
Cites Work
