Minimization of ordered, symmetric half-products
From MaRDI portal
Publication:1763481
DOI10.1016/j.dam.2004.07.007zbMath1084.90030OpenAlexW1979637305MaRDI QIDQ1763481
Publication date: 22 February 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2004.07.007
OptimizationSchedulingHalf-productsFully polynomial time approximation schemesPseudo-Boolean functions
Related Items
A Polytope for a Product of Real Linear Functions in 0/1 Variables, Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications, The symmetric quadratic knapsack problem: approximation and scheduling applications, Pseudo-Boolean optimization, Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications, Positive half-products and scheduling with controllable processing times, Differential approximation schemes for half-product related functions and their scheduling applications, FPTAS for half-products minimization with scheduling applications, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A half-product based approximation scheme for agreeably weighted completion time variance
- Mimimization of agreeably weighted variance in single machine systems
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Completion time variance minimization on a single machine is difficult
- Fast fully polynomial approximation schemes for minimizing completion time variance
- Positive half-products and scheduling with controllable processing times
- New results on the completion time variance minimization
- Minimization of Half-Products
- Maximizing the Product of Two Linear Functions In 0-1 Variables
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Modeling Brain Function
- Algorithms for Scheduling Independent Tasks
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- An analysis of approximations for maximizing submodular set functions—I
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine
- Scheduling independent tasks to reduce mean finishing time
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- Algorithms for minclique scheduling problems
