Computational complexity of finding Pareto efficient outcomes for biobjective lot‐sizing models

E-ISSN： 1520-6750|61|5|386-402

ISSN： 0894-069X

Source： Naval Research Logistics: An International Journal, Vol.61, Iss.5, 2014-08, pp. : 386-402

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

Uncapacitated lot-sizing with buying, sales and backlogging

By Verweij Bram Wolsey Laurence

Optimization Methods and Software, Vol. 19, Iss. 3-4, 2004-06 ,pp. : 427-436

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

Tracing the Pareto frontier in bi-objective optimization problems by ODE techniques

By Potschka Andreas Logist Filip Van Impe Jan Bock Hans

Numerical Algorithms, Vol. 57, Iss. 2, 2011-06 ,pp. : 217-233

Springer Publishing Company

Access to resources Recommend Favorite

Dose finding with longitudinal data: simpler models, richer outcomes

STATISTICS IN MEDICINE, Vol. 34, Iss. 22, 2015-09 ,pp. : 2983-2998

John Wiley & Sons Inc

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