On some techniques useful for solution of transportation network problems
From MaRDI portal
Cites work
Cited in
(60)- An addendum on the incremental assignment problem
- Authors' response to ``An addendum on the incremental assignment problem by Volgenant
- The optimum assignments and a new heuristic approach for the traveling salesman problem
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- A very personal reminiscence on the problem of computational complexity
- Primal-dual algorithms for the assignment problem
- Penelope's graph: a hard minimum cost tension instance
- An algorithm for algebraic assignment problems
- Efficiency and time-cost-tradeoffs in transportation problems
- An augmenting path method for solving linear bottleneck assignment problems
- An augmenting path method for solving linear bottleneck transportation problems
- Testing the necklace condition for shortest tours and optimal factors in the plane
- An efficient algorithm for minimum-weight bibranching
- Linear assignment procedures
- Critical objective function values in linear sum assignment problems
- A comparison of two algorithms for the assignment problem
- Shortest bibranchings and valuated matroid intersection
- A linear assignment approach for the least-squares protein morphing problem
- Distribution-free and model-free multivariate feature screening via multivariate rank distance correlation
- Network flow methods for the minimum covariate imbalance problem
- Computing the sequence of k-cardinality assignments
- Topologically trivial closed walks in directed surface graphs
- Rényi 100, quantitative and qualitative (in)dependence
- Efficient many-to-Many point matching in one dimension
- An algorithm for ranking assignments using reoptimization
- Upper bounds on number of steals in rooted trees
- Linear and semi-assignment problems: A core oriented approach
- Faster algorithms for semi-matching problems
- Minimum-cost flow algorithms: an experimental evaluation
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices
- Index reduction via unimodular transformations
- Linear-time approximation for maximum weight matching
- Local search heuristics for the mobile facility location problem
- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs
- Generalized lexicographically optimal flows in networks with multiple sources and sinks
- Transportation problems which can be solved by the use of hirsch-paths for the dual problems
- An algorithm for then×n optimum assignment problem
- Rangzuordnungsprobleme
- A bad network problem for the simplex method and other minimum cost flow algorithms
- Maximum and optimal 1-2 matching problem of the different kind
- Min-Cost Flow in Unit-Capacity Planar Graphs
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors
- Efficient algorithms for maximum weight matchings in general graphs with small edge weights
- A scaling algorithm for maximum weight matching in bipartite graphs
- Lower bounds for symmetricK-peripatetic salesman problems
- Improving the approximation ratio for capacitated vehicle routing
- Approximating the discrete time-cost tradeoff problem with bounded depth
- Fast primal-dual update against local weight update in linear assignment problem and its application
- 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
- Fair division with two-sided preferences
- Solving a random asymmetric TSP exactly in quasi-polynomial time w.h.p.
- A genuinely polynomial primal simplex algorithm for the assignment problem
- Characterization and algorithm for max-plus supereigenvector problem by parametric programming
- Properties of max-plus algebraic determinants derived from duality theorem
- Bulk search for optimally solving two variants of anonymous multi-agent pathfinding
- On a pair of job-machine assignment problems with two stages
- On dual solutions of the linear assignment problem
- Distribution-free testing in linear and parametric regression
- On the stochastic complexity of the asymmetric traveling salesman problem
This page was built for publication: On some techniques useful for solution of transportation network problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5668591)
