The following pages link to Minimization of Half-Products (Q2757557):
Displaying 33 items.
- Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization (Q256707) (← links)
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209) (← links)
- A generic approach to proving NP-hardness of partition type problems (Q608273) (← links)
- A lower bound for weighted completion time variance (Q613431) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- A half-product based approximation scheme for agreeably weighted completion time variance (Q707130) (← links)
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (Q708332) (← 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)
- Good neighbors are hard to find: Computational complexity of network formation (Q934968) (← links)
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
- FPTAS for half-products minimization with scheduling applications (Q1005250) (← links)
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
- Single machine scheduling with a generalized job-dependent cumulative effect (Q1702657) (← links)
- The single machine weighted mean squared deviation problem (Q1753598) (← links)
- Minimization of ordered, symmetric half-products (Q1763481) (← links)
- Positive half-products and scheduling with controllable processing times (Q1772845) (← links)
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty (Q1785249) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- Stochastic binary problems with simple penalties for capacity constraints violations (Q1949274) (← links)
- On the complexity and approximation of the maximum expected value all-or-nothing subset (Q2192058) (← links)
- Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties (Q2228360) (← links)
- Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection (Q2331597) (← links)
- Optimal testing and repairing a failed series system (Q2369986) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
- Single machine scheduling with controllable release and processing parameters (Q2433805) (← links)
- Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance (Q2434334) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- A Polytope for a Product of Real Linear Functions in 0/1 Variables (Q2897309) (← links)
- Introduction to QUBO (Q5050141) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- Fast Heuristics and Approximation Algorithms (Q5050148) (← links)
