Open AccessBook
Network Optimization: Continuous and Discrete Models
Reads0
Chats0
About:
The article was published on 1998-05-01 and is currently open access. It has received 874 citations till now. The article focuses on the topics: Discrete optimization & Continuous optimization.read more
Citations
More filters
Book
Metaheuristics: From Design to Implementation
TL;DR: This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling.
Journal ArticleDOI
An algebraic approach to network coding
Ralf Koetter,Muriel Medard +1 more
TL;DR: For the multicast setup it is proved that there exist coding strategies that provide maximally robust networks and that do not require adaptation of the network interior to the failure pattern in question.
Posted Content
Computational Optimal Transport
Gabriel Peyré,Marco Cuturi +1 more
TL;DR: This short book reviews OT with a bias toward numerical methods and their applications in data sciences, and sheds lights on the theoretical properties of OT that make it particularly useful for some of these applications.
Book
Routing, Flow, And Capacity Design In Communication And Computer Networks
Michal Pioro,Deepankar Medhi +1 more
TL;DR: Throughout, the authors focus on the traffic demands encountered in the real world of network design, and their generic approach allows problem formulations and solutions to be applied across the board to virtually any type of backbone communication or computer network.
Book ChapterDOI
The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
Marco Dorigo,Thomas Stützle +1 more
TL;DR: The field of ACO algorithms is very lively, as testified, for example, by the successful biannual workshop (ANTS—From Ant Colonies to Artificial Ants: A Series of International Workshops on Ant Algorithms; http://iridia.ulb.ac.be/~ants/) where researchers meet to discuss the properties ofACO and other ant algorithms.
References
More filters
Book
Genetic algorithms in search, optimization, and machine learning
TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
Equation of state calculations by fast computing machines
TL;DR: In this article, a modified Monte Carlo integration over configuration space is used to investigate the properties of a two-dimensional rigid-sphere system with a set of interacting individual molecules, and the results are compared to free volume equations of state and a four-term virial coefficient expansion.