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

Author： Martins Isabel  

Publisher： Springer Publishing Company

ISSN： 0926-6003

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

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 branch‐and‐price algorithm for the (k,c)‐coloring problem

By  

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

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

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

By  

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

By  

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

John Wiley & Sons Inc

Access to resources Recommend Favorite

Branch-and-Cut-and-Price for Capacitated Connected Facility Location

By Leitner Markus  

Journal of Mathematical Modelling and Algorithms, Vol. 10, Iss. 3, 2011-09 ,pp. : 245-267

Springer Publishing Company

Access to resources Recommend Favorite