Solving Large-scale Profit Maximization Capacitated Lot-size Problems by Heuristic Methods

Author： Haugen Kjetil   Olstad Asmund   Pettersen Bård  

Publisher： Springer Publishing Company

ISSN： 1570-1166

Source： Journal of Mathematical Modelling and Algorithms, Vol.6, Iss.1, 2007-03, pp. : 135-149

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

Heuristic Methods for Solving Large Scale Network Routing Problems: The Telpaking Problem

By  

STUDIES IN APPLIED MATHEMATICS, Vol. 22-2526, Iss. 1, 1975-03 ,pp. : 31-60

John Wiley & Sons Inc

Access to resources Recommend Favorite

Heuristic Methods for Solving Large Scale Network Routing Problems: The Telpaking Problem

By  

STUDIES IN APPLIED MATHEMATICS, Vol. 54, Iss. 1, 1975-03 ,pp. : 31-60

John Wiley & Sons Inc

Access to resources Recommend Favorite

Algorithms and Methods for Solving Scheduling Problems and Other Extremum Problems on Large-Scale Graphs

By Pankratiev E.   Chepovskiy A.   Cherepanov E.   Chernyshev S.  

Journal of Mathematical Sciences, Vol. 128, Iss. 6, 2005-08 ,pp. : 3487-3495

Springer Publishing Company

Access to resources Recommend Favorite

Restarted generalized Krylov subspace methods for solving large-scale polynomial eigenvalue problems

By Bao Liang   Lin Yiqin   Wei Yimin  

Numerical Algorithms, Vol. 50, Iss. 1, 2009-01 ,pp. : 17-32

Springer Publishing Company

Access to resources Recommend Favorite

On Solving Large-Scale Finite Minimax Problems Using Exponential Smoothing

By Pee E.   Royset J.  

Journal of Optimization Theory and Applications, Vol. 148, Iss. 2, 2011-02 ,pp. : 390-421

Springer Publishing Company

Access to resources Recommend Favorite