Domination analysis of greedy heuristics for the frequency assignment problem

Publisher： Elsevier

ISSN： 0012-365X

Source： Discrete Mathematics, Vol.275, Iss.1, 2004-01, pp. : 331-338

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Continuous reformulations and heuristics for the Euclidean travelling salesperson problem

By Valkonen Tuomo Kärkkäinen Tommi

ESAIM: Control, Optimisation and Calculus of Variations, Vol. 15, Iss. 4, 2008-08 ,pp. : 895-913

Edp Sciences

Access to resources Recommend Favorite

Potential Function Analysis of Greedy Hot-Potato Routing

By Ben-Dor A. Halevi S. Schuster A.

Theory of Computing Systems, Vol. 31, Iss. 1, 1998-02 ,pp. : 41-61

Springer Publishing Company

Access to resources Recommend Favorite

An Exact Penalty Approach to the Quadratic Assignment Problem

By Körner P.F.

Systems Analysis Modelling Simulation, Vol. 42, Iss. 6, 2002-01 ,pp. : 791-795

Taylor & Francis Ltd

Access to resources Recommend Favorite

Sequential stochastic assignment problem with time-dependent random success rates

Journal of Applied Probability, Vol. 53, Iss. 4, 2016-12 ,pp. : 1052-1063

Cambridge University Press

Access to resources Recommend Favorite

Frequency-Scale Frames and the Solution of the Mexican Hat Problem

By Bui H.-Q. Laugesen R.

Constructive Approximation, Vol. 33, Iss. 2, 2011-04 ,pp. : 163-189

Springer Publishing Company

Access to resources Recommend Favorite