Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
DOI10.1016/J.TCS.2011.09.018zbMATH Open1229.90165OpenAlexW2134024389MaRDI QIDQ655417FDOQ655417
Authors: Ariel Kulik, Hadas Shachnai, Oded Shmueli, Robert Sayegh 
Publication date: 4 January 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.09.018
Recommendations
- Approximation and Online Algorithms
- Approximation algorithms for covering/packing integer programs
- Approximating covering integer programs with multiplicity constraints
- On approximating (sparse) covering integer programs
- Approximation schemes for packing splittable items with cardinality constraints
approximation algorithmsreverse auctionscovering integer programsdeal splittingmulti-dimensional knapsack
Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25) Integer programming (90C10)
Cites Work
- A Greedy Heuristic for the Set-Covering Problem
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- Title not available (Why is that?)
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Title not available (Why is that?)
- THE MULTIPLE-CHOICE KNAPSACK PROBLEM
- Hard multidimensional multiple choice knapsack problems, an empirical study
- Exact algorithms for procurement problems under a total quantity discount structure
- Heuristics for sourcing from multiple suppliers with alternative quantity discounts
- Approximation schemes for generalized \(2\)-dimensional vector packing with application to data placement
- There is no EPTAS for two-dimensional knapsack
- Title not available (Why is that?)
- Approximate algorithms for some generalized knapsack problems
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
- Approximating covering integer programs with multiplicity constraints
- Improved Approximation Guarantees for Packing and Covering Integer Programs
- Scatter search algorithm for supplier selection and order lot sizing under multiple price discount environment
- Approximability of Sparse Integer Programs
- APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS
- Title not available (Why is that?)
- Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems
Cited In (1)
This page was built for publication: Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q655417)
