A combinatorial problem on Trapezoidal words

Author： D'Alessandro F.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.273, Iss.1, 2002-02, pp. : 11-33

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

On a combinatorial property of Sturmian words

By Justin J.   Pirillo G.  

Theoretical Computer Science, Vol. 154, Iss. 2, 1996-02 ,pp. : 387-394

Elsevier

Access to resources Recommend Favorite

Combinatorial aspects of the sensor location problem

By Bianco Lucio  

Annals of Operations Research, Vol. 144, Iss. 1, 2006-04 ,pp. : 201-234

Springer Publishing Company

Access to resources Recommend Favorite

On Heuristics for Solving Winner Determination Problem in Combinatorial Auctions

By Mito Masaya   Fujita Satoshi  

Journal of Heuristics, Vol. 10, Iss. 5, 2004-09 ,pp. : 507-523

Springer Publishing Company

Access to resources Recommend Favorite

Artificial Intelligence Heuristic for Combinatorial Routing Problem

By  

Journal of Information Technology Research (JITR), Vol. 2, Iss. 1, 2009-01 ,pp. : 19-38

IGI Global_journal

Access to resources Recommend Favorite

DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic

By Garrido Pablo  

Journal of Heuristics, Vol. 16, Iss. 6, 2010-12 ,pp. : 795-834

Springer Publishing Company

Access to resources Recommend Favorite