The generalized assignment problem with minimum quantities

DOI10.1016/J.EJOR.2013.01.027MaRDI QIDQ257215zbMATH OpenOpenAlexFDO

Authors Clemens Thielen, Sven O. Krumke

Publication date 15 March 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL http://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/3290

zbMATH Keywords

computational complexitycombinatorial optimizationapproximation algorithmsassignment problems

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2239572
• The generalized assignment problem
• scientific article; zbMATH DE number 3918100
• Solution of a class of generalized assignment problem
• A constant factor approximation for the generalized assignment problem with minimum quantities and unit size items
• An approximation algorithm for the generalized assignment problem
• The bottleneck generalized assignment problem
• An efficient approximation for the generalized assignment problem
• The generalized assignment problem: Valid inequalities and facets
• Approximating the minimum quadratic assignment problems

Cites work

• scientific article; zbMATH DE number 432783 (Why is no real title available?)
• scientific article; zbMATH DE number 3121293 (Why is no real title available?)
• scientific article; zbMATH DE number 3862930 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• A survey of algorithms for the generalized assignment problem
• An approximation algorithm for the generalized assignment problem
• An asymptotic fully polynomial time approximation scheme for bin covering.
• An efficient approximation for the generalized assignment problem
• Approximation algorithms for NP-hard problems.
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Assignment problems: a golden anniversary survey
• Better approximation algorithms for bin covering
• Linear Inequalities and Related Systems. (AM-38)
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Minimal-cost network flow problems with variable lower bounds on arc flows
• Minimum cost flows with minimum quantities
• Network flow optimization with minimum quantities
• Network flows. Theory, algorithms, and applications.
• On a dual version of the one-dimensional bin packing problem
• The hardness of approximation: Gap location

Cited in

(8)

• scientific article; zbMATH DE number 3918100 (Why is no real title available?)
• An alternate approach to solve two-level priority based assignment problem
• Maximum generalized assignment with convex costs
• Tight Approximation Bounds for the Seminar Assignment Problem
• The bidding selection and assignment problem with minimum quantity commitment
• A priority based assignment problem
• Uncertain random assignment problem
• A constant factor approximation for the generalized assignment problem with minimum quantities and unit size items

This page was built for publication: The generalized assignment problem with minimum quantities

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