References
- AartsELenstraJKLocal Search in Combinatorial Optimization2003
- BolandNClarkeLWNemhauserGLThe asymmetric traveling salesman problem with replenishment arcsEuropean Journal of Operational Research2000123240842710.1016/S0377-2217(99)00266-0
- BourgeoisMLaporteGSemetFHeuristics for the black and white traveling salesman problemComputers & Operations Research2003301758510.1016/S0305-0548(01)00082-X
- CosaresSDeutschDNSanieeIWasemOJSONET toolkit: A decision support system for designing robust and cost-effective fiber-optic networksInterfaces1995251204010.1287/inte.25.1.20
- DesrochersMLaporteGImprovements and extensions to the Miller-Tucker-Zemlin subtour elimination constraintsOperations Research Letters1991101273610.1016/0167-6377(91)90083-2
- GendreauMHertzALaporteGNew insertion and postoptimization procedures for the travelling salesman problemOperations Research19924061086109410.1287/opre.40.6.1086
- GhianiGLaporteGSemetFThe black and white traveling salesman problemOperations Research200654236637810.1287/opre.1050.0218
- GloverFTabu search—Part IORSA Journal on Computing19891319020610.1287/ijoc.1.3.190
- GloverFTabu search—Part IIORSA Journal on Computing19902143210.1287/ijoc.2.1.4
- GloverFKochenbergerGHandbook of Metaheuristics2005
- GloverFLagunaMTabu Search1997
- GendreauMHertzALaporteGA Tabu search heuristic for the vehicle routing problemManagement Science199440101276129010.1287/mnsc.40.10.1276
- HertzALaporteGMittazMA Tabu search heuristic for the capacitated arc routing problemOperations Research200048112913510.1287/opre.48.1.129.12455
- Jiang H, Zhang XY, Li M and Che H (2007). Using Gavish-Grave(s) LP to formulate the directed black and white traveling salesman problem. In: Jiang H, Zhang X, Li M and Che H (eds).. Lecture Notes in Computer Science. pp 293–298.
- LaporteGPascoalMMinimum cost path problems with relaysComputers & Operations Research201138116517310.1016/j.cor.2010.04.010
- MakVBolandNHeuristics approaches to the asymmetric travelling salesman problem with replenishment arcsInternational Transactions in Operational Research200074–543144710.1111/j.1475-3995.2000.tb00209.x
- MakVBolandNPolyhedral results and exact algorithms for the asymmetricDiscrete Applied Mathematics2007155162093211010.1016/j.dam.2007.05.014
- OncanTAltinelIKLaporteGA comparative analysis of several asymmetric traveling salesman problem formulationsComputers & Operations Research200936363765410.1016/j.cor.2007.11.008
- TaillardVEBadeauPGendreauMGuertinFPotvinJ-YA Tabu search heuristic for the vehicle routing problem with soft time windowsTransportation Science199731217018610.1287/trsc.31.2.170
- TalluriKTThe four-day aircraft maintenance routing problemTransportation Science1998321435310.1287/trsc.32.1.43
- WasemOJAn algorithm for designing rings in survivable fiber networksIEEE Transactions on Reliability199140442843210.1109/24.93762