scientific article; zbMATH DE number 6460215

zbMATH Open1401.90130MaRDI QIDQ5263929FDOQ5263929

Authors: V. M. Montlevich, A. N. Ismailova 

Publication date: 20 July 2015

Full work available at URL: http://mathnet.ru/eng/vsgu358

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

Recommendations

• scientific article; zbMATH DE number 3885655
• The complexity of approximate algorithms for the problem of integer programming
• scientific article; zbMATH DE number 1830719
• A greedy algorithm for some classes of integer programs.
• On the greedy solution in integer linear programming
• Some recent results in the analysis of greedy algorithms for assignment problems
• scientific article; zbMATH DE number 3959128
• scientific article; zbMATH DE number 3976781
• From approximate to exact integer programming
• An approximate algorithm for nonlinear integer programming

zbMATH Keywords

heuristicsalgorithminteger programminginaccuracygreedy choice

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)

Cited In (4)

• An analysis of six greedy selection rules on a class of zero-one integer programming models
• Title not available (Why is that?)
• Title not available (Why is that?)
• The use of classification theory for automated selection of algorithms in program packages

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