Designing minimum-cost recycling collection networks with required throughput
- 30 September 2008
- journal article
- Published by Elsevier BV in Transportation Research. Part E, Logistics and Transportation Review
- Vol. 44 (5), 731-752
- https://doi.org/10.1016/j.tre.2007.04.002
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- A heuristic algorithm for master planning that satisfies multiple objectivesComputers & Operations Research, 2007
- A unified mixed logit framework for modeling revealed and stated preferences: formulation and application to congestion pricing analysis in the San Francisco Bay areaTransportation Research Part B: Methodological, 2002
- Potential demand for alternative fuel vehiclesTransportation Research Part B: Methodological, 2002
- A statistical analysis of simulated annealing applied to the p-median problemAnnals of Operations Research, 2000
- Formulating a methodology for modelling revealed preference discrete choice data—the selectively replicated logit estimationTransportation Research Part B: Methodological, 1997
- Facility location with and without maximum distance constraints through the p‐median problemInternational Journal of Operations & Production Management, 1995
- Lagrangean heuristics for location problemsEuropean Journal of Operational Research, 1993
- A more efficient heuristic for solving largep-median problemsPapers in Regional Science, 1992
- A tree search algorithm for the p-median problemEuropean Journal of Operational Research, 1982
- A note on two problems in connexion with graphsNumerische Mathematik, 1959