scientific article; zbMATH DE number 4100502

zbMATH Open0672.65036MaRDI QIDQ3826014FDOQ3826014

Authors: Peter Milanov 

Publication date: 1986

Title of this publication is not available (Why is that?)

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
• Publication:4725744

zbMATH Keywords

greedy algorithmaccuracyNP-complete problemstime-complexitylinear discrete optimizationoracle algorithms

Mathematics Subject Classification ID

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

Cited In (2)

• A generalized simplex method for integer problems given by verification oracles
• On the correctness of orphan management algorithms

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)