Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck

DOI10.1080/02331939008843629MaRDI QIDQ3200892zbMATH OpenOpenAlexFDO

Authors

Publication date 1990

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331939008843629

zbMATH Keywords

minimum spanning treebin packingrandom graphssubset sumtraveling salesmanminimum perfect matchingmultiprocessor-schedulingprobabilistic analysis of heuristics

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites work

• scientific article; zbMATH DE number 4194815 (Why is no real title available?)
• scientific article; zbMATH DE number 3889284 (Why is no real title available?)
• scientific article; zbMATH DE number 4205985 (Why is no real title available?)
• scientific article; zbMATH DE number 3902655 (Why is no real title available?)
• scientific article; zbMATH DE number 3932819 (Why is no real title available?)
• scientific article; zbMATH DE number 3939098 (Why is no real title available?)
• scientific article; zbMATH DE number 4033058 (Why is no real title available?)
• scientific article; zbMATH DE number 3664381 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• A review of random graphs
• A stochastic analysis of the NFD bin-packing algorithm
• A survey of heuristics for the weighted matching problem
• An algorithm for finding hamilton cycles in random directed graphs
• On linear programs with random costs
• On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients
• Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching
• Probabilistic asymptotic properties of some combinatorial optimization problems
• Technical Note—On the Expected Performance of Branch-and-Bound Algorithms
• The Probabilistic Analysis of a Heuristic for the Assignment Problem
• The average-case analysis of some on-line algorithms for bin packing
• The chromatic number of random graphs

Cited in

(12)

• scientific article; zbMATH DE number 4079153 (Why is no real title available?)
• Combining Multiple Heuristics
• scientific article; zbMATH DE number 3939098 (Why is no real title available?)
• scientific article; zbMATH DE number 3945879 (Why is no real title available?)
• scientific article; zbMATH DE number 4137536 (Why is no real title available?)
• scientific article; zbMATH DE number 3997543 (Why is no real title available?)
• On some probability inequalities for some discrete optimization problems
• Probabilistic asymptotic properties of some combinatorial optimization problems
• scientific article; zbMATH DE number 3850824 (Why is no real title available?)
• A partitioning algorithm for minimum weighted Euclidean matching
• scientific article; zbMATH DE number 3974320 (Why is no real title available?)
• scientific article; zbMATH DE number 3936510 (Why is no real title available?)

This page was built for publication: Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck

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