A tight upper bound for the k-partition problem on ideal sets

DOI10.1016/S0167-6377(98)00038-8zbMATH Open0955.90038MaRDI QIDQ1306356FDOQ1306356

Authors: Robert R. Goldberg, Jacob Shapiro 

Publication date: 4 March 2001

Published in: Operations Research Letters (Search for Journal in Brave)

Recommendations

• Partitioning ideal sets
• Partitioning under the \(L_p\) norm
• Tighter bounds on a heuristic for a partition problem

zbMATH Keywords

mathematical programmingLagrange multipliersNP-completeworst-case analysisscheduling theory

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Title not available (Why is that?)
• Bounds on Multiprocessing Timing Anomalies
• Title not available (Why is that?)
• Tighter bounds on a heuristic for a partition problem
• Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
• A greedy heuristic for 3-partitioning with similar elements
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• A tight bound for 3-partitioning
• A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines
• An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
• Partitioning under the \(L_p\) norm
• A note on minimizing the sum of squares of machine completion times on two identical parallel machines
• Title not available (Why is that?)

This page was built for publication: A tight upper bound for the \(k\)-partition problem on ideal sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306356)