results
Combinatorial Optimization: Algorithms and Complexity
Author: ChrisRedfield

Christos H. Papadimitriou, ‚ÄéKenneth Steiglitz - Combinatorial Optimization: Algorithms and Complexity
Published: 1998-01-29 | ISBN: 0486402584, 0131524623 | PDF | 528 pages | 49 MB
Details
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity [Repost]
Author: ChrisRedfield

Frank Neumann, Carsten Witt - Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity
Published: 2010-11-04 | ISBN: 3642165435, 3642265847 | PDF | 216 pages | 2.49 MB
Details
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity (repost)
Author: tot167

Frank Neumann, Carsten Witt, "Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity"
S.,.ger | 2010 | ISBN: 3642165435 | 216 pages | PDF | 2,5 MB
Details
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity (Repost)
Author: DZ123

Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity
Publisher: Springer | ISBN: 3642165435 | edition 2010 | PDF | 216 pages | 1,8 mb

Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area. Details
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity (repost)
Author: fdts


by Frank Neumann and Carsten Witt
English | 2010 | ISBN: 3642165435 | 216 pages | PDF | 1.88 MB
Details
Combinatorial Optimization: Theory and Algorithms
Author: Underaglassmoon

Combinatorial Optimization: Theory and Algorithms
Springer | Mathematics | 2000 | ISBN-10: 3662217082 | 530 pages | pdf | 42 mb

Authors: Korte, Bernhard, Vygen, Jens
Well-written textbook on combinatorial optimization
One of very few textbooks on this topic
Subject area has manifold applications
Details
Capacitated Planned Maintenance: Models, Optimization Algorithms, Combinatorial and Polyhedral Properties
Author: Underaglassmoon

Capacitated Planned Maintenance: Models, Optimization Algorithms, Combinatorial and Polyhedral Properties
Springer | Business & Management | December 2, 2016 | ISBN-10: 3319402889 | 286 pages | pdf | 5.51 mb

Authors: Kuschel, Torben
Presents practically relevant, deterministic optimization models and novel algorithms for planned maintenance
Analyzes the computational complexity of several problem classes, polyhedral properties and lower bounds
Includes implementation details and an introduction to the necessary theory
Details
Recent Advances in Evolutionary Computation for Combinatorial Optimization
Author: karapuzik

Recent Advances in Evolutionary Computation for Combinatorial Optimization (Studies in Computational Intelligence)
338 pages | Springer; 1 edition (October 10, 2008) | ISBN-10: 3540708065 | PDF | 5 Mb

Combinatorial optimisation is a ubiquitous discipline whose usefulness spans vast applications domains. The intrinsic complexity of most combinatorial optimisation problems makes classical methods unaffordable in many cases. To acquire practical solutions to these problems requires the use of metaheuristic approaches that trade completeness for pragmatic effectiveness. Such approaches are able to provide optimal or quasi-optimal solutions to a plethora of difficult combinatorial optimisation problems. Details
Recent Advances in Evolutionary Computation for Combinatorial Optimization (repost)
Author: libr

Recent Advances in Evolutionary Computation for Combinatorial Optimization (Studies in Computational Intelligence) by Carlos Cotta and Jano Hemert
English | 1 edition | October 10, 2008 | ISBN-10: 3540708065 | 356 pages | PDF | 5.7 Mb

Combinatorial optimisation is a ubiquitous discipline whose usefulness spans vast applications domains. The intrinsic complexity of most combinatorial optimisation problems makes classical methods unaffordable in many cases. Details
Recent Advances in Evolutionary Computation for Combinatorial Optimization (repost)
Author: rolexmaya

Recent Advances in Evolutionary Computation for Combinatorial Optimization
Springer; 1 edition | October 10, 2008 | ISBN-10: 3540708065 | 356 pages | PDF | 5.7 Mb

Combinatorial optimisation is a ubiquitous discipline whose usefulness spans vast applications domains. The intrinsic complexity of most combinatorial optimisation problems makes classical methods unaffordable in many cases. Details
Found 111 post(s)