A collection of papers surveying recent progress in the field of Combinatorial Optimization. Topics examined include theoretical and computational aspects (Boolean Programming, Probabilistic Analysis of Algorithms, Parallel Computer Models and Combinatorial Algorithms), well-known combinatorial problems (such as the Linear Assignment Problem, the Quadratic Assignment Problem, the Knapsack Problem and Steiner Problems in Graphs) and more applied problems (such as Network Synthesis and Dynamic Network Optimization, Single Facility Location Problems on Networks, the Vehicle Routing Problem and Scheduling Problems).L. Steinberg, alt;alt;The Backboard Wiring Problem: a Placement AlgorithmAr, SlAM Review 3, 37 - 50, 1961. 1. Ugi, J. Bauer, J. Brandt, J. Friedrich, J. Gasteiger, C. Jochum and W. Schubert, alt;alt;Neue Anwendungsgebiete filr Computer in der ChemieAr, Angewandte Chemie 91, 99 - 111, 1979. ... Gerd Finke Rainer E. Burkard Technical University of Nova Scotia Franz Rendl P.O. Box 1000 lnstitut fiir Mathematikanbsp;...

Title | : | Surveys in Combinatorial Optimization |

Author | : | S. Martello, M. Minoux, C. Ribeiro, Gilbert Laporte |

Publisher | : | Elsevier - 2011-09-22 |

Continue