scientific article; zbMATH DE number 3854829

MaRDI QIDQ3323722zbMATH OpenFDO

Authors J.Mitev

Publication date 1984

zbMATH Keywords

combinatorial optimizationalgorithmoriented graphsubgraphminimal total costminimal duration

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 1102774
• scientific article; zbMATH DE number 863497
• scientific article; zbMATH DE number 2096252
• scientific article; zbMATH DE number 50336
• Numerical methods of optimization
• scientific article; zbMATH DE number 780787
• scientific article; zbMATH DE number 3963580
• Computational combinatorial optimization. Optimal of probably near-optimal solutions
• scientific article; zbMATH DE number 1084496
• scientific article; zbMATH DE number 598463

Cited in

(6)

• Article exchange model and its algorithm
• Finding the largest suborder of fixed width
• Computational approaches to a combinatorial optimization problem arising from text classification
• Optimal resolution sequence of problems modelled by directed graphs
• Binary labeling method for combinatrorial problems
• scientific article; zbMATH DE number 49116 (Why is no real title available?)

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 Q3323722)