The following pages link to Antonino Sgalambro (Q325489):
Displayed 14 items.
- Network interdiction through length-bounded critical disruption paths: a bi-objective approach (Q325490) (← links)
- An agent-based framework for modeling and solving location problems (Q610998) (← links)
- A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550) (← links)
- An exact approach for the maximum concurrent \(k\)-splittable flow problem (Q928300) (← links)
- On the approximation of the single source \(k\)-splittable flow problem (Q935843) (← links)
- Models for the schedule optimization problem at a public transit terminal (Q1027998) (← links)
- A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem (Q1651593) (← links)
- Fluidsim: a car traffic simulation prototype based on fluiddynamic (Q1662556) (← links)
- A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem (Q2286869) (← links)
- Service network design models for two-tier city logistics (Q2448205) (← links)
- The Spatially Equitable Multicommodity Capacitated Network Flow Problem (Q3091503) (← links)
- Advanced network connectivity features and zonal requirements in covering location problems (Q6047840) (← links)
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690) (← links)
- A game-theoretic multi-stakeholder model for cost allocation in urban consolidation centres (Q6115615) (← links)