Minimum cost multi-product flow lines
From MaRDI portal
Publication:2480199
Recommendations
- Minimum cost problem of manufacturing network flows
- Minimum cost flows with minimum quantities
- Minimum cost flow problem
- Flow constrained minimum cost flow problem
- Budget-constrained minimum cost flows
- Optimal production planning in pull flow lines with multiple products
- Minimum cost problem of assembly network flows
- The minimal average cost flow problem
- Minimum cost dynamic flows: the series-parallel case
- Multiple objective minimum cost flow problems: a review
Cites work
- scientific article; zbMATH DE number 827942 (Why is no real title available?)
- scientific article; zbMATH DE number 864788 (Why is no real title available?)
- A branch-and-cut approach for a generic multiple-product, assembly-system design problem
- A survey on problems and methods in generalized assembly line balancing
- An approximate \(A^{\ast}\) algorithm and its application to the SCS problem.
- Linear Algorithm for Data Compression via String Matching
- More on the complexity of common superstring and supersequence problems
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
- Optimal Investment in Product-Flexible Manufacturing Capacity
- The Complexity of Some Problems on Subsequences and Supersequences
- The shortest common supersequence problem over binary alphabet is NP- complete
- Theory and algorithms for plan merging
Cited in
(3)
This page was built for publication: Minimum cost multi-product flow lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480199)
