Minimization of Half-Products

Authors:
T. Badics;E. Boros
Affiliations:
-;-
Venue:
Mathematics of Operations Research
Year:
1998

Citing 0
Cited 10

Pseudo-boolean optimization

Discrete Applied Mathematics
Single machine scheduling with controllable release and processing parameters

Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Minimization of ordered, symmetric half-products

Discrete Applied Mathematics
A survey of scheduling with controllable processing times

Discrete Applied Mathematics
Note: FPTAS for half-products minimization with scheduling applications

Discrete Applied Mathematics
Minimization of ordered, symmetric half-products

Discrete Applied Mathematics
Note: Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date

Discrete Applied Mathematics
A generic approach to proving NP-hardness of partition type problems

Discrete Applied Mathematics
Fully polynomial time approximation schemes for scheduling divisible loads

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a special class of quadratic functions, the so called half-products are considered. It is shown that while the minimization over the set of binary n-vectors for half-products is NP-complete, an ε-approximating solution can be found in polynomial time for any ε 0.