Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Combinatorial and Global Optimization

BuchGebunden
372 Seiten
Englisch
Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, and biological and computer science. This is a selection of refereed papers based on talks presented at a conference on "Combinatorial and Global Optimization" held at Crete.mehr

Produkt

KlappentextCombinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, and biological and computer science. This is a selection of refereed papers based on talks presented at a conference on "Combinatorial and Global Optimization" held at Crete.
Details
ISBN/GTIN978-981-02-4802-4
ProduktartBuch
EinbandartGebunden
FormatGenäht
Erscheinungsjahr2002
Erscheinungsdatum08.04.2002
Seiten372 Seiten
SpracheEnglisch
MasseBreite 163 mm, Höhe 226 mm, Dicke 25 mm
Gewicht630 g
Artikel-Nr.13637198

Inhalt/Kritik

Inhaltsverzeichnis
A forest exterior point algorithm for assignment problems, H. Achatz et al; location/allocation of queuing facilities in continuous space using minsum and minimax criteria, J. Brimberg et al; algorithms for the consistency analysis in scenario projects, R. Feldmann et al; solving quadratic knapsack problems by reformulation and tabu search -single constraint case, F. Glover et al; global optimization using dynamic search trajectories, A.A. Groenwold and J.A. Snyman; on Pareto efficiency - a general constructive existence principle, G. Isac; piecewise linear network flow problems, D. Kim and P.M. Pardalos; semidefinite programming approaches for MAX-2-SAT and MAX-3-SAT - computational perspectives, E. de Klerk and J.P. Warners; heuristic solutions of vehicle routing problems in supply chain management, Y. Marinakis and A. Migdalas; a new finite cone covering algorithm for concave minimization, C. Meyer and B. Jaumard; frequency assignment for very large, sparse networks, R. Murphey; GPS network design - an application of the simulated annealing heuristic technique, H.A. Saleh and P.J. Dare; normal branch and bound algorithms for general nonconvex quadratic programming, H. Tuy. (Part contents)mehr

Autor