Pages that link to "Item:Q1406040"
From MaRDI portal
The following pages link to Approximating covering integer programs with multiplicity constraints (Q1406040):
Displaying 15 items.
- Approximation algorithm for partial positive influence problem in social network (Q511731) (← links)
- Approximation schemes for deal splitting and covering integer programs with multiplicity constraints (Q655417) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
- Lower bounds and algorithms for the minimum cardinality bin covering problem (Q1752204) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- Approximation algorithms for the covering-type \(k\)-violation linear program (Q2329669) (← links)
- Local ratio method on partial set multi-cover (Q2410050) (← links)
- Approximation algorithms for covering/packing integer programs (Q2575835) (← links)
- Covering Linear Programming with Violations (Q2940540) (← links)
- On Capacitated Set Cover Problems (Q3088080) (← links)
- Monotone Covering Problems with an Additional Covering Constraint (Q3169028) (← links)
- Approximate Deadline-Scheduling with Precedence Constraints (Q3452812) (← links)
- Constraint solving via fractional edge covers (Q3581534) (← links)
- Approximation and Online Algorithms (Q5713428) (← links)