An Introduction to Robust Combinatorial Optimization
Author: Marc Goerigk
Publisher: Springer Nature
Published:
Total Pages: 316
ISBN-13: 3031612612
DOWNLOAD EBOOKRead and Download eBook Full
Author: Marc Goerigk
Publisher: Springer Nature
Published:
Total Pages: 316
ISBN-13: 3031612612
DOWNLOAD EBOOKAuthor: Alberto Del Pia
Publisher: Springer Nature
Published: 2023-05-21
Total Pages: 494
ISBN-13: 3031327268
DOWNLOAD EBOOKThis book constitutes the refereed proceedings of the 24th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2023, held in Madison, WI, USA, during June 21–23, 2023. The 33 full papers presented were carefully reviewed and selected from 119 submissions. IPCO is under the auspices of the Mathematical Optimization Society, and it is an important forum for presenting present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.
Author: Matteo Fischetti
Publisher: Springer
Published: 2007-06-26
Total Pages: 509
ISBN-13: 3540727922
DOWNLOAD EBOOKThis book constitutes the refereed proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, held in Ithaca, NY, USA, in June 2007. Among the topics addressed in the 36 revised full papers are approximation algorithms, algorithmic game theory, computational biology, integer programming, polyhedral combinatorics, scheduling theory and scheduling algorithms, as well as semidefinite programs.
Author: Emile H. L. Aarts
Publisher: Princeton University Press
Published: 2003-08-03
Total Pages: 530
ISBN-13: 9780691115221
DOWNLOAD EBOOK1. Introduction -- 2. Computational complexity -- 3. Local improvement on discrete structures -- 4. Simulated annealing -- 5. Tabu search -- 6. Genetic algorithms -- 7. Artificial neural networks -- 8. The traveling salesman problem: A case study -- 9. Vehicle routing: Modern heuristics -- 10. Vehicle routing: Handling edge exchanges -- 11. Machine scheduling -- 12. VLSI layout synthesis -- 13. Code design.
Author: Raffaele Cerulli
Publisher: Springer
Published: 2016-09-09
Total Pages: 470
ISBN-13: 3319455877
DOWNLOAD EBOOKThis book constitutes the thoroughly refereed post-conference proceedings of the 4th International Symposium on Combinatorial Optimization, ISCO 2016, held in Vietri sul Mare, Italy, in May 2016. The 38 revised full papers presented in this book were carefully reviewed and selected from 98 submissions. They present original research on all aspects of combinatorial optimization, such as algorithms and complexity; mathematical programming; operations research; stochastic optimization; and graphs and combinatorics.
Author: Dennis Huisman
Publisher: Springer
Published: 2014-07-10
Total Pages: 481
ISBN-13: 3319070010
DOWNLOAD EBOOKThis book contains a selection of refereed papers presented at the “International Conference on Operations Research (OR 2013)” which took place at Erasmus University Rotterdam September 3-6, 2013. The conference was jointly organized by the German and the Dutch OR Society. More than 800 scientists and students from over 50 countries attended OR 2013 and presented more than 600 papers in parallel topical streams, as well as special award sessions. The theme of the conference and its proceedings is "Impact on People, Business and Society".
Author: Pierre Fouilhoux
Publisher: Springer
Published: 2014-07-21
Total Pages: 462
ISBN-13: 3319091743
DOWNLOAD EBOOKThis book constitutes the thoroughly refereed post-conference proceedings of the Third International Symposium on Combinatorial Optimization, ISCO 2014, held in Lisbon, Portugal, in March 2014. The 37 revised full papers presented together with 64 short papers were carefully reviewed and selected from 97 submissions. They present original research on all aspects of combinatorial optimization, such as algorithms and complexity; mathematical programming; operations research; stochastic optimization; graphs and combinatorics.
Author: Aharon Ben-Tal
Publisher: Princeton University Press
Published: 2009-08-10
Total Pages: 565
ISBN-13: 1400831059
DOWNLOAD EBOOKRobust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle such problems today without considering this powerful methodology. Written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the first book to provide a comprehensive and up-to-date account of the subject. Robust optimization is designed to meet some major challenges associated with uncertainty-affected optimization problems: to operate under lack of full information on the nature of uncertainty; to model the problem in a form that can be solved efficiently; and to provide guarantees about the performance of the solution. The book starts with a relatively simple treatment of uncertain linear programming, proceeding with a deep analysis of the interconnections between the construction of appropriate uncertainty sets and the classical chance constraints (probabilistic) approach. It then develops the robust optimization theory for uncertain conic quadratic and semidefinite optimization problems and dynamic (multistage) problems. The theory is supported by numerous examples and computational illustrations. An essential book for anyone working on optimization and decision making under uncertainty, Robust Optimization also makes an ideal graduate textbook on the subject.
Author: Jon Lee
Publisher: Cambridge University Press
Published: 2004-02-09
Total Pages: 232
ISBN-13: 9780521010122
DOWNLOAD EBOOKA First Course in Combinatorial Optimization is a text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.
Author: Vangelis Th. Paschos
Publisher: John Wiley & Sons
Published: 2014-08-08
Total Pages: 626
ISBN-13: 1119015197
DOWNLOAD EBOOKCombinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: - On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; - Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; - Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.