The k-Track Assignment Problem on Partial Orders

ISSN： 1094-6136

Source： Journal of Scheduling, Vol.8, Iss.2, 2005-04, pp. : 135-143

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

Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem

By Ahuja Ravindra Cunha Claudio

Journal of Heuristics, Vol. 11, Iss. 5-6, 2005-12 ,pp. : 465-481

Springer Publishing Company

Access to resources Recommend Favorite

Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem

By Xiao Mingyu Cai Leizhen Yao Andrew

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 510-520

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Solution of A, x ^(k) = b ^(k) Using A ⁻¹

By Ditkowski Adi Fibich Gadi Gavish Nir

Journal of Scientific Computing, Vol. 32, Iss. 1, 2007-07 ,pp. : 29-44

Springer Publishing Company

Access to resources Recommend Favorite

Recognizing d -Interval Graphs and d -Track Interval Graphs

By Jiang Minghui

Algorithmica, Vol. 66, Iss. 3, 2013-07 ,pp. : 541-563

Springer Publishing Company

Access to resources Recommend Favorite

A Hybrid Heuristic for the p-Median Problem

By Resende Mauricio G.C. Werneck Renato F.

Journal of Heuristics, Vol. 10, Iss. 1, 2004-01 ,pp. : 59-88

Springer Publishing Company

Access to resources Recommend Favorite