Structural results on a batch acceptance problem for capacitated queues

ISSN： 1432-2994

Source： Mathematical Methods of Operations Research, Vol.66, Iss.2, 2007-10, pp. : 263-274

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

A cutting plane algorithm for the capacitated facility location problem

By Avella Pasquale Boccia Maurizio

Computational Optimization and Applications, Vol. 43, Iss. 1, 2009-05 ,pp. : 39-65

Springer Publishing Company

Access to resources Recommend Favorite

The quickest path problem with batch constraints

By Calvete H.I. del Pozo L.

Operations Research Letters, Vol. 31, Iss. 4, 2003-07 ,pp. : 277-284

Elsevier

Access to resources Recommend Favorite

An approximation algorithm for the k-level capacitated facility location problem

By Du Donglei Wang Xing Xu Dachuan

Journal of Combinatorial Optimization, Vol. 20, Iss. 4, 2010-11 ,pp. : 361-368

Springer Publishing Company

Access to resources Recommend Favorite

Improved lower bounds for the capacitated lot sizing problem with setup times

By Jans R. Degraeve Z.

Operations Research Letters, Vol. 32, Iss. 2, 2004-03 ,pp. : 185-195

Elsevier

Access to resources Recommend Favorite

An augmented Lagrangian origin‐based algorithm for link‐capacitated traffic assignment problem

JOURNAL OF ADVANCED TRANSPORTATION, Vol. 49, Iss. 4, 2015-06 ,pp. : 553-567

John Wiley & Sons Inc

Access to resources Recommend Favorite