The generalized assignment problem with minimum quantities
From MaRDI portal
Publication:257215
DOI10.1016/J.EJOR.2013.01.027zbMath1332.90227OpenAlexW2020267722MaRDI QIDQ257215
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
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (4)
Tight Approximation Bounds for the Seminar Assignment Problem ⋮ A priority based assignment problem ⋮ Uncertain random assignment problem ⋮ An alternate approach to solve two-level priority based assignment problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal-cost network flow problems with variable lower bounds on arc flows
- An efficient approximation for the generalized assignment problem
- Assignment problems: a golden anniversary survey
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- A survey of algorithms for the generalized assignment problem
- An approximation algorithm for the generalized assignment problem
- The hardness of approximation: Gap location
- An asymptotic fully polynomial time approximation scheme for bin covering.
- Minimum cost flows with minimum quantities
- On a dual version of the one-dimensional bin packing problem
- Linear Inequalities and Related Systems. (AM-38)
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Network Flow Optimization with Minimum Quantities
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
This page was built for publication: The generalized assignment problem with minimum quantities
