Improving heuristics for the frequency assignment problem
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Volgenant, Ton & Jonker, Roy, 1982. "A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation," European Journal of Operational Research, Elsevier, vol. 9(1), pages 83-89, January.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Iztok Fister & Marjan Mernik & Bogdan Filipič, 2013. "Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm," Computational Optimization and Applications, Springer, vol. 54(3), pages 741-770, April.
- Montemanni, R. & Smith, D. H. & Allen, S. M., 2004. "An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem," European Journal of Operational Research, Elsevier, vol. 156(3), pages 736-751, August.
- Karen Aardal & Stan Hoesel & Arie Koster & Carlo Mannino & Antonio Sassano, 2007. "Models and solution techniques for frequency assignment problems," Annals of Operations Research, Springer, vol. 153(1), pages 79-129, September.
- Lü, Zhipeng & Hao, Jin-Kao, 2010. "A memetic algorithm for graph coloring," European Journal of Operational Research, Elsevier, vol. 203(1), pages 241-250, May.
- Zehui Shao & Aleksander Vesel, 2015. "$$L(3,2,1)$$ L ( 3 , 2 , 1 ) -labeling of triangular and toroidal grids," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(3), pages 659-673, September.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Tang, Lixin & Liu, Jiyin & Rong, Aiying & Yang, Zihou, 2000. "A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex," European Journal of Operational Research, Elsevier, vol. 124(2), pages 267-282, July.
- Peter Reiter & Walter Gutjahr, 2012. "Exact hybrid algorithms for solving a bi-objective vehicle routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(1), pages 19-43, March.
- Lieshout, P.M.D. & Volgenant, A., 2007. "A branch-and-bound algorithm for the singly constrained assignment problem," European Journal of Operational Research, Elsevier, vol. 176(1), pages 151-164, January.
- Zamani, Reza & Lau, Sim Kim, 2010. "Embedding learning capability in Lagrangean relaxation: An application to the travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 201(1), pages 82-88, February.
- Edwin R. van Dam & Gijs Rennen & Bart Husslage, 2009.
"Bounds for Maximin Latin Hypercube Designs,"
Operations Research, INFORMS, vol. 57(3), pages 595-608, June.
- van Dam, E.R. & Rennen, G. & Husslage, B.G.M., 2007. "Bounds for Maximin Latin Hypercube Designs," Discussion Paper 2007-16, Tilburg University, Center for Economic Research.
- van Dam, E.R. & Rennen, G. & Husslage, B.G.M., 2009. "Bounds for maximin Latin hypercube designs," Other publications TiSEM f556d9e2-e3b9-42db-96ee-9, Tilburg University, School of Economics and Management.
- van Dam, E.R. & Rennen, G. & Husslage, B.G.M., 2007. "Bounds for Maximin Latin Hypercube Designs," Other publications TiSEM da0c15be-f18e-474e-b557-f, Tilburg University, School of Economics and Management.
- R. Dekker & M. B. M. de Koster & K. J. Roodbergen & H. van Kalleveen, 2004. "Improving Order-Picking Response Time at Ankor's Warehouse," Interfaces, INFORMS, vol. 34(4), pages 303-313, August.
- Krzysztof C. Kiwiel & Torbjörn Larsson & P. O. Lindberg, 1999. "The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 24(1), pages 237-254, February.
- Öztürkoğlu, Ömer & Hoser, Deniz, 2019. "A discrete cross aisle design model for order-picking warehouses," European Journal of Operational Research, Elsevier, vol. 275(2), pages 411-430.
- Jamal Ouenniche & Prasanna K. Ramaswamy & Michel Gendreau, 2017. "A dual local search framework for combinatorial optimization problems with TSP application," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1377-1398, November.
- Gianpaolo Ghiani & Gilbert Laporte & Frédéric Semet, 2006. "The Black and White Traveling Salesman Problem," Operations Research, INFORMS, vol. 54(2), pages 366-378, April.
- Muren, & Wu, Jianjun & Zhou, Li & Du, Zhiping & Lv, Ying, 2019. "Mixed steepest descent algorithm for the traveling salesman problem and application in air logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 87-102.
- Lorena, Luiz Antonio N. & Goncalves Narciso, Marcelo, 2002. "Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems," European Journal of Operational Research, Elsevier, vol. 138(3), pages 473-483, May.
- Tsubakitani, Shigeru & Evans, James R., 1998. "An empirical study of a new metaheuristic for the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 104(1), pages 113-128, January.
- Rennen, G., 2009. "Efficient approximation of black-box functions and Pareto sets," Other publications TiSEM 83f4bb26-c7f0-4733-b08d-c, Tilburg University, School of Economics and Management.
- Çavdar, Bahar & Sokol, Joel, 2015. "TSP Race: Minimizing completion time in time-sensitive applications," European Journal of Operational Research, Elsevier, vol. 244(1), pages 47-54.
- Helsgaun, Keld, 2000. "An effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, Elsevier, vol. 126(1), pages 106-130, October.
- Valenzuela, Christine L. & Jones, Antonia J., 1997. "Estimating the Held-Karp lower bound for the geometric TSP," European Journal of Operational Research, Elsevier, vol. 102(1), pages 157-175, October.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:107:y:1998:i:1:p:76-86. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.