scientific article; zbMATH DE number 2163022

zbMATH Open1094.68121MaRDI QIDQ4673409

Klaus Jansen

Publication date: 29 April 2005

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

zbMATH Keywords

convex optimizationconcave optimization

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (1)

Pseudo-polynomial time algorithms for combinatorial food mixture packing problems

Recommendations

• Title not available (Why is that?) 👍 👎
• Faster and simpler approximation algorithms for mixed packing and covering problems 👍 👎
• Approximation algorithms for covering/packing integer programs 👍 👎
• Approximation Algorithm for the Mixed Fractional Packing and Covering Problem 👍 👎
• An Approximation Algorithm for the General Mixed Packing and Covering Problem 👍 👎
• Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems 👍 👎
• Fast Approximation Algorithms for Fractional Packing and Covering Problems 👍 👎
• Approximation Schemes for Covering and Packing 👍 👎
• Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations 👍 👎
• Approximation and Online 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 Q4673409)