Pages that link to "Item:Q3004202"
From MaRDI portal
The following pages link to Clique partitioning of interval graphs with submodular costs on the cliques (Q3004202):
Displaying 13 items.
- Max point-tolerance graphs (Q344833) (← links)
- Minimum entropy combinatorial optimization problems (Q693045) (← links)
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
- Interval scheduling with economies of scale (Q2108158) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (Q2423295) (← links)
- A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685) (← links)
- APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES (Q3397507) (← links)
- Minimum Entropy Combinatorial Optimization Problems (Q3576040) (← links)
- Latency Constrained Aggregation in Chain Networks Admits a PTAS (Q3638456) (← links)
- “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)
- Covering and packing of triangles intersecting a straight line (Q5918763) (← links)
