A clique-based algorithm for constructing feasible timetables

Author： Liu Yongkai   Zhang Defu   Chin Francis  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.26, Iss.2, 2011-04, pp. : 281-294

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

The modified subgradient algorithm based on feasible values

By Kasimbeyli Refail  

Optimization, Vol. 58, Iss. 5, 2009-07 ,pp. : 535-560

Taylor & Francis Ltd

Access to resources Recommend Favorite

2-Approximation algorithm for finding a clique with minimum weight of vertices and edges

By Eremin I.   Gimadi E.   Kel’manov A.   Pyatkin A.   Khachai M.  

Proceedings of the Steklov Institute of Mathematics, Vol. 284, Iss. 1, 2014-04 ,pp. : 87-95

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

On maximum degree‐based γ‐quasi‐clique problem: Complexity and exact approaches

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 71, Iss. 2, 2018-03 ,pp. : 136-152

John Wiley & Sons Inc

Access to resources Recommend Favorite

A Feasible Algorithm for Locating Concave and Convex Zones of Interval Data and Its Use in Statistics-Based Clustering: SCAN'2002 International Conference (Guest Editors: René Alt and Jean-Luc Lamotte)

By Kreinovich Vladik   Pauwels Eric J.   Ferson Scott A.   Ginzburg Lev  

Numerical Algorithms, Vol. 37, Iss. 1-4, 2004-12 ,pp. : 225-232

Springer Publishing Company

Access to resources Recommend Favorite

An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs

By Bhattacharya B.K.   Kaller D.  

Journal of Algorithms, Vol. 25, Iss. 2, 1997-11 ,pp. : 336-358

Academic Press

Access to resources Recommend Favorite