Antonino Sgalambro

Orcid: 0000-0002-0052-4950

According to our database1, Antonino Sgalambro authored at least 15 papers between 2008 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A hybrid modified-NSGA-II VNS algorithm for the Multi-Objective Critical Disruption Path Problem.
Comput. Oper. Res., December, 2023

Advanced network connectivity features and zonal requirements in Covering Location problems.
Comput. Oper. Res., November, 2023

A game-theoretic multi-stakeholder model for cost allocation in urban consolidation centres.
Ann. Oper. Res., May, 2023

2020
A branch and price algorithm to solve the Quickest Multicommodity <i>k</i>-splittable Flow Problem.
Eur. J. Oper. Res., 2020

On carriers collaboration in hub location problems.
Eur. J. Oper. Res., 2020

2018
A matheuristic approach for the Quickest Multicommodity <i>k</i>-Splittable Flow Problem.
Comput. Oper. Res., 2018

2016
Network Interdiction through Length-Bounded Critical Disruption Paths: a Bi-Objective Approach.
Electron. Notes Discret. Math., 2016

2014
Service network design models for two-tier city logistics.
Optim. Lett., 2014

2012
An extension of the schedule optimization problem at a public transit terminal to the multiple destinations case.
Public Transp., 2012

2011
The Spatially Equitable Multicommodity Capacitated Network Flow Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
A fast heuristic algorithm for the maximum concurrent <i>k</i>-splittable flow problem.
Optim. Lett., 2010

Fluidsim: A Car Traffic Simulation Prototype Based on FluidDynamic.
Algorithms, 2010

2009
Models for the schedule optimization problem at a public transit terminal.
OR Spectr., 2009

2008
An exact approach for the maximum concurrent <i>k</i> -splittable flow problem.
Optim. Lett., 2008

On the approximation of the single source k-splittable flow problem.
J. Discrete Algorithms, 2008


  Loading...