A branch‐and‐price algorithm for the (k,c)‐coloring problem

E-ISSN： 1097-0037|65|4|353-366

ISSN： 0028-3045

Source： NETWORKS: AN INTERNATIONAL JOURNAL, Vol.65, Iss.4, 2015-07, pp. : 353-366

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 revised branch‐and‐price algorithm for dial‐a‐ride problems with the consideration of time‐dependent travel cost

JOURNAL OF ADVANCED TRANSPORTATION, Vol. 197-6729, Iss. 6, 2015-10 ,pp. : 700-723

John Wiley & Sons Inc

Access to resources Recommend Favorite

A revised branch‐and‐price algorithm for dial‐a‐ride problems with the consideration of time‐dependent travel cost

JOURNAL OF ADVANCED TRANSPORTATION, Vol. 49, Iss. 6, 2015-10 ,pp. : 700-723

John Wiley & Sons Inc

Access to resources Recommend Favorite

Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem

By Pimentel Carina Maria Oliveira Alvelos Filipe Pereira Valerio de Carvalho Jose

Optimization Methods and Software, Vol. 25, Iss. 2, 2010-04 ,pp. : 299-319

Taylor & Francis Ltd

Access to resources Recommend Favorite

Polyhedral results and a Branch-and-cut algorithm for the [TEX equation: k] -cardinality tree problem

By Simonetti Luidi Cunha Alexandre Lucena Abilio

Mathematical Programming, Vol. 142, Iss. 1-2, 2013-12 ,pp. : 511-538

Elsevier

Access to resources Recommend Favorite

A branch-and-price approach for harvest scheduling subject to maximum area restrictions

By Martins Isabel

Computational Optimization and Applications, Vol. 51, Iss. 1, 2012-01 ,pp. : 363-385

Springer Publishing Company

Access to resources Recommend Favorite