The scheme complexity of discrete optimization

DOI10.1515/DMA.1993.3.2.127MaRDI QIDQ4303922zbMATH OpenOpenAlexFDO

Authors Al. A. Markov

Publication date 7 September 1994

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1993.3.2.127

zbMATH Keywords

synthesis of computing schemes

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 3862927
• Completeness of vector discrete optimization problems
• Discrete optimization by optimal control methods. I: Separable problems
• scientific article; zbMATH DE number 3930904
• scientific article; zbMATH DE number 3867065

Cited in

(5)

• A discrete EOQ problem is solvable in \(O(\log n)\) time
• scientific article; zbMATH DE number 5799870 (Why is no real title available?)
• OPTi's Algorithm for Discreteness Determination
• On the Complexity of 2D Discrete Fixed Point Problem
• On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems

This page was built for publication: The scheme complexity of discrete optimization

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