Optimization of an SMD placement machine and flows in parametric networks

zbMATH Open1236.90046MaRDI QIDQ2882852FDOQ2882852

Authors: Katarina Cechlárová, Tamás Fleiner 

Publication date: 8 May 2012

Published in: Kybernetika (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/197097

Recommendations

• Parametric flows in static networks
• A Fast Parametric Maximum Flow Algorithm and Applications
• Parametric max flow problems in a class of networks with series-parallel structure
• scientific article; zbMATH DE number 5585920
• Parametric maximal flows in generalized networks – complexity and algorithms

zbMATH Keywords

algorithmnetwork flowSMD machine optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Flows in graphs (05C21) Production models (90B30)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Maximal Flow Through a Network
• A Fast Parametric Maximum Flow Algorithm and Applications
• The quadratic assignment problem in the context of the printed circuit board assembly process
• Complexity of some parametric integer and network programming problems
• Ottimizzazione Combinatoria
• A parametric maximum flow algorithm for bipartite graphs with applications
• Generalization of a theorem on the parametric maximum flow problem
• A note on the parametric maximum flow problem and some related reoptimization issues
• Optimal bin location and sequencing in printed circuit board assembly
• Note on combinatorial optimization with max-linear objective functions
• Algorithms for flows with parametric capacities

Cited In (1)

• A model to optimize placement operations on dual-head placement machines

This page was built for publication: Optimization of an SMD placement machine and flows in parametric networks

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