scientific article; zbMATH DE number 2068071
From MaRDI portal
Publication:4464679
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
Cited in
(1)
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)