Analysis of fractional covering of some supply management problems

DOI10.1007/S10852-005-9016-ZzbMATH Open1121.90400OpenAlexW2011265317WikidataQ57607357 ScholiaQ57607357MaRDI QIDQ853804FDOQ853804

Authors: L. A. Zaozerskaya 

Publication date: 17 November 2006

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-005-9016-z

Recommendations

• Approximation solution of the supply management problem
• Approximation and Online Algorithms
• The multicovering problem
• scientific article; zbMATH DE number 2159455
• scientific article; zbMATH DE number 9246

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Mixed integer programming (90C11)

Cites Work

• The concave cost supply problem.
• The set covering problem: Complexity, algorithms, experiments
• Title not available (Why is that?)
• Approximation of the supply scheduling problem
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Estimation of the number of iterations in integer programming algorithms using the regular partitions method
• On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4]

This page was built for publication: Analysis of fractional covering of some supply management problems

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