Method for optimzing functionals of permutations in the presence of constraints

DOI10.1007/BF01099370MaRDI QIDQ3893338zbMATH OpenFDO

Authors V. Ya. Burdyuk, V. N. Reva

Publication date 1980

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01099370

zbMATH Keywords

optimizing functinals of permutations

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Cites work

• An effective solution of the Bellman-Johnson problem on a tree-like network
• scientific article; zbMATH DE number 3520146 (Why is no real title available?)

Cited in

(4)

• Using precedence intervals to solve constrained precedence problems
• Sequencing functions and optimizations on permutations of a partially ordered set
• Effective optimization methods for single-machine scheduling (survey)
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation

This page was built for publication: Method for optimzing functionals of permutations in the presence of constraints

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