A Short Note on a Simple Search Heuristic for the Diskspacking Problem

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.131, Iss.1-4, 2004-10, pp. : 101-108

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

Abstract

Related content

An Application of Tabu Search Heuristic for the Maximum Edge-Weighted Subgraph Problem

By Macambira E.M.

Annals of Operations Research, Vol. 117, Iss. 1-4, 2002-11 ,pp. : 175-190

Springer Publishing Company

Access to resources Recommend Favorite

A piecewise linearization for retail shelf space allocation problem and a local search heuristic

By Gajjar Hasmukh

Annals of Operations Research, Vol. 179, Iss. 1, 2010-09 ,pp. : 149-167

Springer Publishing Company

Access to resources Recommend Favorite

A tabu search heuristic for the component assignment problem in PCB assembly

By Wan Y.F. Ji P

Assembly Automation, Vol. 21, Iss. 3, 2001-07 ,pp. : 236-240

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Depth-first heuristic search for the job shop scheduling problem

By Mencía Carlos

Annals of Operations Research, Vol. 206, Iss. 1, 2013-07 ,pp. : 265-296

Springer Publishing Company

Access to resources Recommend Favorite

An iterated-tabu-search heuristic for a variant of the partial set covering problem

By Bilal Nehme Galinier Philippe Guibault Francois

Journal of Heuristics, Vol. 20, Iss. 2, 2014-04 ,pp. : 143-164

Springer Publishing Company

Access to resources Recommend Favorite