Related content

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

Fix and Relax Heuristic for a Stochastic Lot-Sizing Problem

By Beraldi P.   Ghiani G.   Grieco A.   Guerriero E.  

Computational Optimization and Applications, Vol. 33, Iss. 2-3, 2006-03 ,pp. : 303-318

Springer Publishing Company

Access to resources Recommend Favorite

The Determination of Upper and Lower Bounds for the Solution of the Dirichlet Problem

By  

STUDIES IN APPLIED MATHEMATICS, Vol. 97-1421, Iss. 1, 1948-04 ,pp. : 161-182

John Wiley & Sons Inc

Access to resources Recommend Favorite

The Determination of Upper and Lower Bounds for the Solution of the Dirichlet Problem

By  

STUDIES IN APPLIED MATHEMATICS, Vol. 27, Iss. 1, 1948-04 ,pp. : 161-182

John Wiley & Sons Inc

Access to resources Recommend Favorite

Improved Lower Bounds for Learning from Noisy Examples: An Information-Theoretic Approach

By Gentile C.   Helmbold D.P.  

Information and Computation, Vol. 166, Iss. 2, 2001-05 ,pp. : 133-155

Academic Press

Access to resources Recommend Favorite