A simple but NP-hard problem of mixed-discrete programming and its solution by approximate algorithms

DOI10.1080/02331938508843069zbMATH Open0581.90064OpenAlexW2057178844MaRDI QIDQ3703591FDOQ3703591

Authors: Stephan Dempe 

Publication date: 1985

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938508843069

Recommendations

• scientific article; zbMATH DE number 3942929
• scientific article; zbMATH DE number 3922375
• scientific article; zbMATH DE number 3885655
• scientific article; zbMATH DE number 3976782
• scientific article; zbMATH DE number 3972639

zbMATH Keywords

polynomial approximate algorithmsgreedy versionNP-hard mixed programming

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cites Work

• Title not available (Why is that?)

Cited In (4)

• Complexity analysis and algorithms for the program download problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: A simple but NP-hard problem of mixed-discrete programming and its solution by approximate algorithms

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