scientific article; zbMATH DE number 1182758

zbMATH Open0907.90186MaRDI QIDQ4400841FDOQ4400841

Authors: David B. Shmoys 

Publication date: 2 August 1998

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1670526
• Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems
• LP-based algorithms for capacitated facility location
• scientific article; zbMATH DE number 1187151

zbMATH Keywords

approximation algorithmslinear programming relaxationnear-optimal solutionuncapacitated facility locationscheduling precedence-constrained jobs

Mathematics Subject Classification ID

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

Cited In (6)

• Designing PTASs for MIN-SUM scheduling problems
• Preemptive and non-preemptive generalized min sum set cover
• Finding total unimodularity in optimization problems solved by linear programs
• Approximation algorithms for shop scheduling problems with minsum objective
• Solving the maximum duo-preservation string mapping problem with linear programming
• Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems

This page was built for publication:

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