scientific article; zbMATH DE number 3997543

MaRDI QIDQ4724418zbMATH OpenFDO

Authors Pedro G. Gazmuri

Publication date 1986

zbMATH Keywords

asymptotic performancegraph coloringmachine schedulingNP-complete combinatorial optimizationprobabilistic analysis of algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 4137536
• scientific article; zbMATH DE number 3974320
• scientific article; zbMATH DE number 4049028
• Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck
• scientific article; zbMATH DE number 3936510

Cited in

(11)

• Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
• Probabilistic analysis of the generalised assignment problem
• Stochastic analysis of greedy algorithms for the subset sum problem
• Probabilistic analysis of a bin covering algorithm
• A Probabilistic Analysis of Christofides’ Algorithm
• scientific article; zbMATH DE number 4137536 (Why is no real title available?)
• scientific article; zbMATH DE number 3974320 (Why is no real title available?)
• scientific article; zbMATH DE number 4049028 (Why is no real title available?)
• scientific article; zbMATH DE number 1961527 (Why is no real title available?)
• scientific article; zbMATH DE number 764392 (Why is no real title available?)
• Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space

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 Q4724418)