Pages that link to "Item:Q5668591"

The following pages link to On some techniques useful for solution of transportation network problems (Q5668591):

Displaying 50 items.

• Upper bounds on number of steals in rooted trees (Q255260) (← links)
• Local search heuristics for the mobile facility location problem (Q337654) (← links)
• Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors (Q521811) (← links)
• A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
• On a pair of job-machine assignment problems with two stages (Q732901) (← links)
• On dual solutions of the linear assignment problem (Q761971) (← links)
• Distribution-free testing in linear and parametric regression (Q825054) (← links)
• On the stochastic complexity of the asymmetric traveling salesman problem (Q915656) (← links)
• An addendum on the incremental assignment problem (Q1007874) (← links)
• Authors' response to ``An addendum on the incremental assignment problem'' by Volgenant (Q1007876) (← links)
• The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562) (← links)
• A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
• A very personal reminiscence on the problem of computational complexity (Q1091818) (← links)
• Primal-dual algorithms for the assignment problem (Q1095790) (← links)
• Penelope's graph: a hard minimum cost tension instance (Q1127551) (← links)
• An algorithm for algebraic assignment problems (Q1138479) (← links)
• Efficiency and time-cost-tradeoffs in transportation problems (Q1169400) (← links)
• An augmenting path method for solving linear bottleneck assignment problems (Q1244171) (← links)
• An augmenting path method for solving linear bottleneck transportation problems (Q1254950) (← links)
• Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
• An efficient algorithm for minimum-weight bibranching (Q1272485) (← links)
• Linear assignment procedures (Q1610146) (← links)
• Critical objective function values in linear sum assignment problems (Q1743488) (← links)
• A comparison of two algorithms for the assignment problem (Q1804373) (← links)
• Shortest bibranchings and valuated matroid intersection (Q1926655) (← links)
• A linear assignment approach for the least-squares protein morphing problem (Q1960195) (← links)
• Distribution-free and model-free multivariate feature screening via multivariate rank distance correlation (Q2079620) (← links)
• Network flow methods for the minimum covariate imbalance problem (Q2116900) (← links)
• Computing the sequence of \(k\)-cardinality assignments (Q2165282) (← links)
• Topologically trivial closed walks in directed surface graphs (Q2223623) (← links)
• Rényi 100, quantitative and qualitative (in)dependence (Q2236653) (← links)
• Efficient many-to-Many point matching in one dimension (Q2373930) (← links)
• An algorithm for ranking assignments using reoptimization (Q2483518) (← links)
• Linear and semi-assignment problems: A core oriented approach (Q2563894) (← links)
• Faster Algorithms for Semi-Matching Problems (Q2799478) (← links)
• Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
• Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices (Q3121390) (← links)
• Index Reduction via Unimodular Transformations (Q3176353) (← links)
• Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
• A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs (Q3503840) (← links)
• Generalized lexicographically optimal flows in networks with multiple sources and sinks (Q3668257) (← links)
• Transportation problems which can be solved by the use of hirsch-paths for the dual problems (Q3783840) (← links)
• An algorithm for then×n optimum assignment problem (Q3890004) (← links)
• Rangzuordnungsprobleme (Q4117596) (← links)
• A bad network problem for the simplex method and other minimum cost flow algorithms (Q4775712) (← links)
• Maximum and optimal 1-2 matching problem of the different kind (Q5035028) (← links)
• Min-Cost Flow in Unit-Capacity Planar Graphs (Q5075811) (← links)
• (Q5743485) (← links)
• (Q5743486) (← links)
• Lower bounds for symmetric<i>K</i>-peripatetic salesman problems (Q5749147) (← links)