scientific article; zbMATH DE number 1182758

From MaRDI portal

Publication:4400841

Jump to:navigation, search

zbMath0907.90186MaRDI QIDQ4400841

David B. Shmoys

Publication date: 2 August 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear programming relaxation approximation algorithms near-optimal solution uncapacitated facility location scheduling precedence-constrained jobs

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (4)

Solving the maximum duo-preservation string mapping problem with linear programming ⋮ Preemptive and non-preemptive generalized min sum set cover ⋮ Designing PTASs for MIN-SUM scheduling problems ⋮ Approximation algorithms for shop scheduling problems with minsum objective

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4400841&oldid=18424118"