A computational analysis of lower bounds for big bucket production planning problems

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.53, Iss.3, 2012-12, pp. : 729-753

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

Lower Bounds for Dynamic Algebraic Problems

By Frandsen G.S. Hansen J.P. Miltersen P.B.

Information and Computation, Vol. 171, Iss. 2, 2001-12 ,pp. : 333-349

Academic Press

Access to resources Recommend Favorite

Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems

By Kullmann Oliver

Annals of Mathematics and Artificial Intelligence, Vol. 40, Iss. 3-4, 2004-03 ,pp. : 303-352

Springer Publishing Company

Access to resources Recommend Favorite

Inductive Time-Space Lower Bounds for Sat and Related Problems

By Williams Ryan

computational complexity, Vol. 15, Iss. 4, 2006-12 ,pp. : 433-470

Springer Publishing Company

Access to resources Recommend Favorite

Strong bounds on the approximability of two Pspace-hard problems in propositional planning

By Jonsson P.

Annals of Mathematics and Artificial Intelligence, Vol. 26, Iss. 1-4, 1999-01 ,pp. : 133-147

Springer Publishing Company

Access to resources Recommend Favorite

Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems

By Beck Amir Teboulle Marc

Optimization Methods and Software, Vol. 18, Iss. 4, 2003-08 ,pp. : 377-394

Taylor & Francis Ltd

Access to resources Recommend Favorite