Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck
DOI10.1080/02331939008843629zbMath0714.90083OpenAlexW2065120224MaRDI QIDQ3200892
No author found.
Publication date: 1990
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939008843629
traveling salesmanrandom graphsminimum spanning treebin packingsubset summinimum perfect matchingmultiprocessor-schedulingprobabilistic analysis of heuristics
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
- Probabilistic asymptotic properties of some combinatorial optimization problems
- The average-case analysis of some on-line algorithms for bin packing
- A survey of heuristics for the weighted matching problem
- Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching
- On linear programs with random costs
- A stochastic analysis of the NFD bin-packing algorithm
- An algorithm for finding hamilton cycles in random directed graphs
- The Probabilistic Analysis of a Heuristic for the Assignment Problem
- On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients
- Technical Note—On the Expected Performance of Branch-and-Bound Algorithms
- A review of random graphs
- The chromatic number of random graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck
