Pages that link to "Item:Q2373727"

The following pages link to Multicommodity flows over time: Efficient algorithms and complexity (Q2373727):

Displaying 25 items.

• Computational complexity of convoy movement planning problems (Q494695) (← links)
• The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths (Q741538) (← links)
• Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle (Q828730) (← links)
• The impact of local policies on the quality of packet routing in paths, trees, and rings (Q835620) (← links)
• An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths (Q967437) (← links)
• Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem (Q1615965) (← links)
• A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem (Q1651593) (← links)
• An exact algorithm for a multicommodity min-cost flow over time problem (Q1742211) (← links)
• A tight bound on the speed-up through storage for quickest multi-commodity flows (Q1785329) (← links)
• Heterogeneous multi-commodity network flows over time (Q2097229) (← links)
• Dynamic multicommodity contraflow problem with asymmetric transit times (Q2138334) (← links)
• Abstract flows over time: a first step towards solving dynamic packing problems (Q2250460) (← links)
• A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem (Q2286869) (← links)
• Cascading knapsack inequalities: reformulation of a crude oil distribution problem (Q2393477) (← links)
• An Introduction to Network Flows over Time (Q2971621) (← links)
• Earliest arrival flows on series-parallel graphs (Q3082606) (← links)
• The Maximum Energy-Constrained Dynamic Flow Problem (Q3512452) (← links)
• Traffic Networks and Flows over Time (Q3637317) (← links)
• (Q5020876) (← links)
• Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems (Q5136261) (← links)
• Bounding Residence Times for Atomic Dynamic Routings (Q5870375) (← links)
• An exact algorithm for the service network design problem with hub capacity constraints (Q6085889) (← links)
• Scalable timing-aware network design via Lagrangian decomposition (Q6112744) (← links)
• The non-stop disjoint trajectories problem (Q6564192) (← links)
• Integer linear programming formulations for the fleet quickest routing problem on grids (Q6619788) (← links)