Minimization of Half-Products
From MaRDI portal
Publication:2757557
DOI10.1287/moor.23.3.649zbMath0977.90026OpenAlexW2165355715WikidataQ59560822 ScholiaQ59560822MaRDI QIDQ2757557
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e117da3d6abb2ca86bfe75830e381d14915a7cef
fully polynomial approximation schemecompletion time variance minimizationquadratic binary minimization
Related Items (33)
Optimal testing and repairing a failed series system ⋮ A Polytope for a Product of Real Linear Functions in 0/1 Variables ⋮ Introduction to QUBO ⋮ Complexity and Polynomially Solvable Special Cases of QUBO ⋮ Fast Heuristics and Approximation Algorithms ⋮ Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications ⋮ A survey of scheduling with controllable processing times ⋮ Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints ⋮ Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions ⋮ A generic approach to proving NP-hardness of partition type problems ⋮ A lower bound for weighted completion time variance ⋮ The symmetric quadratic knapsack problem: approximation and scheduling applications ⋮ On the complexity and approximation of the maximum expected value all-or-nothing subset ⋮ Single machine scheduling with a generalized job-dependent cumulative effect ⋮ Single machine scheduling with controllable release and processing parameters ⋮ Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance ⋮ Stochastic binary problems with simple penalties for capacity constraints violations ⋮ Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties ⋮ Good neighbors are hard to find: Computational complexity of network formation ⋮ The single machine weighted mean squared deviation problem ⋮ Pseudo-Boolean optimization ⋮ Minimization of ordered, symmetric half-products ⋮ Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications ⋮ A half-product based approximation scheme for agreeably weighted completion time variance ⋮ Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date ⋮ Positive half-products and scheduling with controllable processing times ⋮ On the complexity of the single machine scheduling problem minimizing total weighted delay penalty ⋮ Differential approximation schemes for half-product related functions and their scheduling applications ⋮ Approximability issues for unconstrained and constrained maximization of half-product related functions ⋮ FPTAS for half-products minimization with scheduling applications ⋮ Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection ⋮ Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization ⋮ Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
This page was built for publication: Minimization of Half-Products
