The following pages link to (Q4952606):
Displayed 50 items.
- On fixed cost \(k\)-flow problems (Q260248) (← links)
- Throughput maximization in multiprocessor speed-scaling (Q278716) (← links)
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
- The minimum vulnerability problem (Q487032) (← links)
- On set expansion problems and the small set expansion conjecture (Q494429) (← links)
- Fractional routing using pairs of failure-disjoint paths (Q496701) (← links)
- Approximability of sparse integer programs (Q634673) (← links)
- Approximating integer programs with positive right-hand sides (Q656570) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- LP-based approximation algorithms for capacitated facility location (Q662296) (← links)
- A note on submodular function minimization with covering type linear constraints (Q722536) (← links)
- Approximation algorithms for the partition vertex cover problem (Q744047) (← links)
- Primal-dual schema for capacitated covering problems (Q747765) (← links)
- Faster and simpler approximation algorithms for mixed packing and covering problems (Q884474) (← links)
- Approximating covering integer programs with multiplicity constraints (Q1406040) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (Q1683679) (← links)
- Greedy algorithms for the single-demand facility location problem (Q1728306) (← links)
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
- Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- Easy capacitated facility location problems, with connections to lot-sizing (Q1984675) (← links)
- Pitch, extension complexity, and covering problems (Q2060545) (← links)
- Precedence-constrained covering problems with multiplicity constraints (Q2085754) (← links)
- A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
- Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
- An approximation algorithm for the partial covering 0-1 integer program (Q2297657) (← links)
- Approximability of capacitated network design (Q2354026) (← links)
- Primal-dual algorithms for precedence constrained covering problems (Q2408089) (← links)
- Fixed-charge transportation on a path: optimization, LP formulations and separation (Q2434997) (← links)
- Approximating the two-level facility location problem via a quasi-greedy approach (Q2494518) (← links)
- Approximation algorithms for covering/packing integer programs (Q2575835) (← links)
- An improved approximation algorithm for vertex cover with hard capacities (Q2581755) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- On inequalities with bounded coefficients and pitch for the min knapsack polytope (Q2673233) (← links)
- Fixed-parameter algorithms for unsplittable flow cover (Q2701069) (← links)
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives (Q2701386) (← links)
- Throughput Maximization in Multiprocessor Speed-Scaling (Q2942633) (← links)
- LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
- Approximability of Capacitated Network Design (Q3009752) (← links)
- Fixed-Charge Transportation on a Path: Linear Programming Formulations (Q3009780) (← links)
- On Capacitated Set Cover Problems (Q3088080) (← links)
- A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems (Q3088089) (← links)
- Fair Scheduling via Iterative Quasi-Uniform Sampling (Q3304734) (← links)
- Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities (Q3387909) (← links)
- Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities (Q3448831) (← links)
- Approximate Deadline-Scheduling with Precedence Constraints (Q3452812) (← links)
- A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem (Q3452846) (← links)