scientific article; zbMATH DE number 4100502

MaRDI QIDQ3826014zbMATH OpenFDO

Authors Peter Milanov

Publication date 1986

zbMATH Keywords

accuracygreedy algorithmlinear discrete optimizationNP-complete problemsoracle algorithmstime-complexity

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11)

Recommendations

• Approximating Oracle Machines for Combinatorial Optimization
• A simple but NP-hard problem of mixed-discrete programming and its solution by approximate algorithms
• scientific article; zbMATH DE number 3950207
• Intractability and analysis of heuristics for discrete optimization. II
• scientific article; zbMATH DE number 3999286

Cited in

(3)

• Approximating Oracle Machines for Combinatorial Optimization
• On the correctness of orphan management algorithms
• A generalized simplex method for integer problems given by verification oracles

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