References
- PowellWBA comparative review of alternative algorithms for the dynamic vehicle allocation problemVehicle Routing: Methods and Studies1988249289
- BookbinderJHSethiSPThe dynamic transportation problem: a surveyNaval Res Logistics Quart198027658710.1002/nav.3800270107
- AronsonJEA survey of dynamic network flowsAnn Op Res19892016610.1007/BF02216922
- GordeauJFThe VRP with time windowsThe Vehicle Routing Problem2002157193
- GordeauJFA guide to vehicle routing heuristicsJ Opl Res Soc20025351252210.1057/palgrave.jors.2601319
- LaporteGSemetFClassical heuristics for the capacitated VRPThe Vehicle Routing Problem2002109128
- GendreauMLaporteGPotvinJYMetaheuristics for the capacitated VRPThe Vehicle Routing Problem2002129154
- LaporteGLouveauxFVStochastic vehicle routing problemsEncyclopedia of Optimization2001377379
- CordeauJFLaporteGMercierAA unified tabu search heuristic for vehicle routing problems with time windowsJ Op Res Soc20015292893610.1057/palgrave.jors.2601163
- FordLRFulkersonDRFlows in Networks1962
- ChalmetLGFrancisRLSaundersPBNetwork models for building evacuationMngt Sci1982288610510.1287/mnsc.28.1.86
- JarvisJJRatliffHDSome equivalent objectives for dynamic network flow problemsMngt Sci19822810610910.1287/mnsc.28.1.106
- Choi W, Francis RL, Hamacher HW and Tufekci S (1984). Network models of building evacuation problems with flow-dependent exit capacities. In: Brans JP (ed). Operational Research '84: Proceedings of the Tenth IFORS International Conference on Operational Research. Elsevier, New York, pp 1047–1059.
- ChoiWHamacherHWTufekciSModelling of building evacuation problems by network flows with side constraintsEur J Opl Res1988359811010.1016/0377-2217(88)90382-7
- HamacherHWTufekciSOn the use of lexicographic minimum cost flows in evacuation modelingNaval Res Logist19873448750310.1002/1520-6750(198708)34:4<487::AID-NAV3220340404>3.0.CO;2-9
- Hoppe B and Tardos E (1994). Polynomial time algorithms for some evacuation problems. In: Sleator DD (ed). Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, pp 433–441.
- Hoppe B and Tardos E (1995). The quickest transshipment problem. In: Clarkson K (ed). Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, pp 512–521.
- Fleischer L (1998). Faster algorithms for the quickest transshipment problem with zero transit times. In: Karloff H (ed). Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, pp 147–156.
- DaskinMSNetwork and Discrete Location: Models, Algorithms and Applications1995
- DreznerZFacility Location: A Survey of Applications and Methods1995
- LoveRMorrisJGWesolowshyGOFacilities Location: Models and Methods1988
- CooperLThe transportation–location problemsOpns Res1972209410810.1287/opre.20.1.94
- LoveRJuelHProperties and solution methods for large location-allocation problems with rectangular distancesJ Opl Res Soc198233443452
- LoveRMorrisJGA computational procedure for the exact solution of location-allocation problems with rectangular distancesNaval Res Logist Quart19752244145310.1002/nav.3800220304
- CooperLLocation-allocation problemsOpns Res19631133134310.1287/opre.11.3.331
- KolenAComplexity of Location Problems on Networks, BW 107/791979
- MirchandaniPBFrancisRLDiscrete Location Theory1990
- O'KellyMEQuadratic integer program for the location of interacting hub facilitiesEur J Opl Res19873239340410.1016/S0377-2217(87)80007-3
- KlincewiczJGHeuristics for the p-hub location problemEur J Opl Res199153253710.1016/0377-2217(91)90090-I
- Skorin-KapovDSkorin-KapovJO'KellyMETight linear programming relaxations of uncapacitated p-hub median problemsEur J Opl Res19969458259310.1016/0377-2217(95)00100-X
- AhujaRKMagnantiTLOrlinJBNetwork Flows: Theory, Algorithms, and Applications1993
- FrangioniADual-ascent methods and multicommodity flow problems1997
- TardosEA strongly polynomial algorithm to solve combinatorial linear programsOpns Res19863425025610.1287/opre.34.2.250
- Vaidya PM (1989). Speeding up linear programming using fast matrix multiplication. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Washington, DC, pp 332–337.
- McBrideRDProgress made in solving the multicommodity flow problemSIAM J Optim1998894795510.1137/S1052623496304542
- McBrideRDAdvances in solving the multicommodity flow problemInterfaces1998282324110.1287/inte.28.2.32
- Leighton T and Rao S (1988). An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Washington, DC, pp 422–431.
- GargNKonemannJFaster and simpler algorithms for multicommodity flow and other fractional packing problemsProceedings of the 39th Annual Symposium on Foundations of Computer Science1998300309
- ShahrokhiFMatulaDWThe maximum concurrent flow problemJ Assoc Comput Machinery19903731833410.1145/77600.77620
- LeightonTRaoSMulticommodity max-flow min-cut theorems and their use in designing approximation algorithmsJ Assoc Comput Machinery19994678783210.1145/331524.331526
- BarnhartCDual-ascent methods for large-scale multicommodity flow problemsNaval Research Logistics19934030532410.1002/1520-6750(199304)40:3<305::AID-NAV3220400303>3.0.CO;2-4
- BarnhartCSheffyYA network-based primal-dual heuristic for multicommodity network flow problemsTransport Sci19932710211710.1287/trsc.27.2.102
- BarnhartCHaneCAVancePInteger Multicommodity Flow Problems1996
- BrunettaLConfortiMFischettiMA polyhedral approach to an integer multicommodity flow problemDiscrete ApplMath2000101133610.1016/S0166-218X(99)00187-0
- GareyMSJohnsonDSComputers and Intractibility: A Guide to the Theory of NP-Completeness1979
- CoffmanEGJrGareyMRJohnsonDSApproximation algorithms for bin packing: a surveyApproximation Algorithms for NP-hard Problems19974693
- MartelloSTothPKnapsack Problems: Algorithms and Computer Implementations1990
- ReevesCRHybrid genetic algorithms for bin-packing and related problemsAnn Opns Res19966337139610.1007/BF02125404
- FalkenauerEA new representation and operators for genetic algorithms applied to grouping problemsEvol Comput1994212314410.1162/evco.1994.2.2.123
- VinkMSolving Combinatorial Problems using Evolutionary Algorithms1997
- FalkenauerEA hybrid grouping genetic algorithm for bin packingJ Heuristics1996253010.1007/BF00226291
- Valerio de CarvalhoJMExact solution of bin-packing problems using column generation and branch-and-boundAnn Opns Res19998662965910.1023/A:1018952112615
- GentIPHeuristic solution of open bin packing problemsJ Heuristics1998329930410.1023/A:1009678411503
- Djang PA and Finch PR (1998). Solving one dimension bin packing problems. Unpublished manuscript, US Army Research Laboratory, Adelphi, MD, USA, [email protected]
- CsirikJA self organising bin packing heuristicInternational Workshop on Algorithm Engineering and Experimentation1999246265