Approximation algorithms for the integrated path and bin packing problem
From MaRDI portal
Cites work
- A combination of parallel machine scheduling and the covering problem
- A generalized approximation framework for fractional network flow and packing problems
- An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Approximation schemes for scheduling on parallel machines
- Approximation Schemes for the Restricted Shortest Path Problem
- Bin packing can be solved within 1+epsilon in linear time
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Combination of parallel machine scheduling and vertex cover
- Improved approximation algorithms for the combination problem of parallel machine scheduling and path
- Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules
- On the complexity and approximability of budget-constrained minimum cost flows
- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
- Vertex cover meets scheduling
This page was built for publication: Approximation algorithms for the integrated path and bin packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7023071)
