The following pages link to Stefano Pallottino (Q811324):
Displaying 32 items.
- The maximum flow problem: A max-preflow approach (Q811325) (← links)
- The stack loading and unloading problem (Q1003472) (← links)
- (Q1106091) (redirect page) (← links)
- Equilibrium traffic assignment for large scale transit networks (Q1106092) (← links)
- A new algorithm to find the shortest paths between all pairs of nodes (Q1157967) (← links)
- Postoptimizing equilibrium flows on large scale networks (Q1278241) (← links)
- A new algorithm for reoptimizing shortest paths when the arc costs change (Q1413907) (← links)
- Directed hypergraphs and applications (Q1803674) (← links)
- Polynomial auction algorithms for shortest paths (Q1804574) (← links)
- On uniform \(k\)-partition problems (Q2565854) (← links)
- Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks (Q2783794) (← links)
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem (Q3114903) (← links)
- Technical Note—Traffic Equilibrium Paradoxes (Q3356066) (← links)
- Shortest‐path methods: Complexity, interrelations and new propositions (Q3706872) (← links)
- (Q3718484) (← links)
- (Q3722287) (← links)
- (Q3723711) (← links)
- Shortest path methods: A unifying approach (Q3743140) (← links)
- (Q3835329) (← links)
- (Q3854901) (← links)
- (Q3870931) (← links)
- An Efficient Algorithm for Determining the Length of the Longest Dead Path in a “LIFO” Branch-and-Bound Exploration Schema (Q3920660) (← links)
- A dual simplex algorithm for finding all shortest paths (Q3926369) (← links)
- Dual algorithms for the shortest path tree problem (Q4367280) (← links)
- Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights (Q4408702) (← links)
- A Modeling Framework for Passenger Assignment on a Transport Network with Timetables (Q4411187) (← links)
- Dynamic shortest paths minimizing travel times and costs (Q4419276) (← links)
- Large-scale local search heuristics for the capacitated vertex<i>p</i>-center problem (Q4474299) (← links)
- (Q4495163) (← links)
- Fair dissections of spiders, worms, and caterpillars (Q4712690) (← links)
- (Q4811408) (← links)
- (Q4889081) (← links)
