scientific article; zbMATH DE number 3896657

MaRDI QIDQ3675893zbMATH OpenFDO

Authors Peter Brucker

Publication date 1984

zbMATH Keywords

divide and conquer strategiesknapsack problemsnetwork flowselection problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Linear programming (90C05) Integer programming (90C10)

Recommendations

• The principle of optimality in the design of efficient algorithms
• Applications of a strategy for designing divide-and-conquer algorithms
• scientific article; zbMATH DE number 863497
• Theoretical improvements in algorithmic efficiency for network flow problems
• scientific article; zbMATH DE number 519872

Cited in

(4)

• The principle of optimality in the design of efficient algorithms
• scientific article; zbMATH DE number 3466833 (Why is no real title available?)
• scientific article; zbMATH DE number 194610 (Why is no real title available?)
• scientific article; zbMATH DE number 2119189 (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 Q3675893)