Stefano Pallottino

Available identifiers

zbMath Open pallottino.stefanoMaRDI QIDQ811324

List of research outcomes

Publication	Date of Publication	Type
A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem	2012-02-19	Paper
The stack loading and unloading problem	2009-03-04	Paper
On uniform \(k\)-partition problems	2005-09-28	Paper
https://portal.mardi4nfdi.de/entity/Q4811408	2004-09-06	Paper
Large-scale local search heuristics for the capacitated vertexp-center problem	2004-08-04	Paper
A new algorithm for reoptimizing shortest paths when the arc costs change	2003-11-17	Paper
Dynamic shortest paths minimizing travel times and costs	2003-07-31	Paper
Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights	2003-06-29	Paper
Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks	2002-04-17	Paper
https://portal.mardi4nfdi.de/entity/Q4495163	2001-11-21	Paper
A Modeling Framework for Passenger Assignment on a Transport Network with Timetables	2001-01-01	Paper
Postoptimizing equilibrium flows on large scale networks	1999-02-22	Paper
Dual algorithms for the shortest path tree problem	1997-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q4889081	1996-08-11	Paper
Polynomial auction algorithms for shortest paths	1995-06-11	Paper
Directed hypergraphs and applications	1993-06-29	Paper
Fair dissections of spiders, worms, and caterpillars	1992-06-25	Paper
The maximum flow problem: A max-preflow approach	1991-01-01	Paper
Technical Note—Traffic Equilibrium Paradoxes	1991-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3835329	1989-01-01	Paper
Equilibrium traffic assignment for large scale transit networks	1988-01-01	Paper
Shortest path methods: A unifying approach	1986-01-01	Paper
Shortest‐path methods: Complexity, interrelations and new propositions	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3722287	1984-01-01	Paper
A new algorithm to find the shortest paths between all pairs of nodes	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3723711	1981-01-01	Paper
An Efficient Algorithm for Determining the Length of the Longest Dead Path in a “LIFO” Branch-and-Bound Exploration Schema	1981-01-01	Paper
A dual simplex algorithm for finding all shortest paths	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3718484	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3854901	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3870931	1978-01-01	Paper

Research outcomes over time

This page was built for person: Stefano Pallottino