Pages that link to "Item:Q257209"
From MaRDI portal
The following pages link to Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209):
Displaying 13 items.
- Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization (Q256707) (← links)
- Two-machine open-shop scheduling with rejection to minimize the makespan (Q280183) (← links)
- Communication scheduling in data gathering networks of heterogeneous sensors with data compression: algorithms and empirical experiments (Q724122) (← links)
- Differential approximation schemes for half-product related functions and their scheduling applications (Q729806) (← links)
- Approximability issues for unconstrained and constrained maximization of half-product related functions (Q730001) (← links)
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
- Algorithms for communication scheduling in data gathering network with data compression (Q1755733) (← links)
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty (Q1785249) (← links)
- Single machine scheduling with non-availability interval and optional job rejection (Q2168742) (← links)
- Order acceptance and scheduling with machine availability constraints (Q2255964) (← links)
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- Unrelated parallel machine scheduling problem with special controllable processing times and setups (Q2676390) (← links)
