scientific article; zbMATH DE number 2068071

zbMATH Open1176.90343MaRDI QIDQ4464679FDOQ4464679

Authors: Robert Murphey 

Publication date: 27 May 2004

Title of this publication is not available (Why is that?)

Recommendations

• A branch-and-bound algorithm for scheduling of new product development projects
• A dual approach to multi-dimensional assignment problems
• scientific article; zbMATH DE number 1329926
• A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
• A representation model for the solving-time distribution of a set of design tasks in new product development (NPD)
• Un algoritmo misto per il problema dell'assegnazione pluridimensionale
• A multi-objective programming approach to 1.5-dimensional assortment problem
• A branch-and-cut approach for a generic multiple-product, assembly-system design problem
• R \& D planning and the generalized assignment problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Marketing, advertising (90B60)

Cited In (1)

• A representation model for the solving-time distribution of a set of design tasks in new product development (NPD)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4464679)