An Introduction To Robust Combinatorial Optimization

Author : Marc Goerigk,Michael Hartisch
Publisher : Springer
Page : 0 pages
File Size : 45,8 Mb
Release : 2024-08-03
Category : Business & Economics
ISBN : 3031612604

Get Book

An Introduction to Robust Combinatorial Optimization by Marc Goerigk,Michael Hartisch Pdf

This book offers a self-contained introduction to the world of robust combinatorial optimization. It explores decision-making using the min-max and min-max regret criteria, while also delving into the two-stage and recoverable robust optimization paradigms. It begins by introducing readers to general results for interval, discrete, and budgeted uncertainty sets, and subsequently provides a comprehensive examination of specific combinatorial problems, including the selection, shortest path, spanning tree, assignment, knapsack, and traveling salesperson problems. The book equips both students and newcomers to the field with a grasp of the fundamental questions and ongoing advancements in robust optimization. Based on the authors’ years of teaching and refining numerous courses, it not only offers essential tools but also highlights the open questions that define this subject area.

Author : Christina Büsing
Publisher : Unknown
Page : 154 pages
File Size : 43,5 Mb
Release : 2011
Category : Kombinatorische Optimierung / swd / (DE-101)040318265 / (DE-588c)4031826-6
ISBN : 3869557710

Get Book

Recoverable Robustness in Combinatorial Optimization by Christina Büsing Pdf

Author : Aharon Ben-Tal,Laurent El Ghaoui,Arkadi Nemirovski
Publisher : Princeton University Press
Page : 576 pages
File Size : 45,5 Mb
Release : 2009-08-10
Category : Mathematics
ISBN : 9781400831050

Get Book

Robust Optimization by Aharon Ben-Tal,Laurent El Ghaoui,Arkadi Nemirovski Pdf

Robust 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 : Bernhard Korte,Jens Vygen
Publisher : Springer Science & Business Media
Page : 596 pages
File Size : 54,9 Mb
Release : 2006-01-27
Category : Mathematics
ISBN : 9783540292975

Get Book

Combinatorial Optimization by Bernhard Korte,Jens Vygen Pdf

This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete (but concise) proofs, as well as many deep results, some of which have not appeared in any previous books.

Author : Ding-Zhu Du,Panos M. Pardalos,Xiaodong Hu,Weili Wu
Publisher : Springer Nature
Page : 407 pages
File Size : 45,9 Mb
Release : 2022-09-26
Category : Mathematics
ISBN : 9783031105968

Get Book

Introduction to Combinatorial Optimization by Ding-Zhu Du,Panos M. Pardalos,Xiaodong Hu,Weili Wu Pdf

Introductory courses in combinatorial optimization are popular at the upper undergraduate/graduate levels in computer science, industrial engineering, and business management/OR, owed to its wide applications in these fields. There are several published textbooks that treat this course and the authors have used many of them in their own teaching experiences. This present text fills a gap and is organized with a stress on methodology and relevant content, providing a step-by-step approach for the student to become proficient in solving combinatorial optimization problems. Applications and problems are considered via recent technology developments including wireless communication, cloud computing, social networks, and machine learning, to name several, and the reader is led to the frontiers of combinatorial optimization. Each chapter presents common problems, such as minimum spanning tree, shortest path, maximum matching, network flow, set-cover, as well as key algorithms, such as greedy algorithm, dynamic programming, augmenting path, and divide-and-conquer. Historical notes, ample exercises in every chapter, strategically placed graphics, and an extensive bibliography are amongst the gems of this textbook.

Author : Jon Lee
Publisher : Cambridge University Press
Page : 232 pages
File Size : 46,5 Mb
Release : 2004-02-09
Category : Business & Economics
ISBN : 0521010128

Get Book

A First Course in Combinatorial Optimization by Jon Lee Pdf

A 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 : Lap Chi Lau,R. Ravi,Mohit Singh
Publisher : Cambridge University Press
Page : 255 pages
File Size : 55,7 Mb
Release : 2011-04-18
Category : Computers
ISBN : 9781139499392

Get Book

Iterative Methods in Combinatorial Optimization by Lap Chi Lau,R. Ravi,Mohit Singh Pdf

With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.

Author : Laurence A. Wolsey,George L. Nemhauser
Publisher : John Wiley & Sons
Page : 782 pages
File Size : 48,9 Mb
Release : 2014-08-28
Category : Mathematics
ISBN : 9781118626863

Get Book

Integer and Combinatorial Optimization by Laurence A. Wolsey,George L. Nemhauser Pdf

Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION "This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list."-Optima "A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems."-Computing Reviews "[This book] can serve as a basis for various graduate courses on discrete optimization as well as a reference book for researchers and practitioners."-Mathematical Reviews "This comprehensive and wide-ranging book will undoubtedly become a standard reference book for all those in the field of combinatorial optimization."-Bulletin of the London Mathematical Society "This text should be required reading for anybody who intends to do research in this area or even just to keep abreast of developments."-Times Higher Education Supplement, London Also of interest . . . INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive and self-contained, this intermediate-level guide to integer programming provides readers with clear, up-to-date explanations on why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively. 1998 (0-471-28366-5) 260 pp.

Author : L. R. Foulds
Publisher : Springer Science & Business Media
Page : 236 pages
File Size : 55,6 Mb
Release : 2012-12-06
Category : Mathematics
ISBN : 9781461395119

Get Book

Combinatorial Optimization for Undergraduates by L. R. Foulds Pdf

The major purpose of this book is to introduce the main concepts of discrete optimization problems which have a finite number of feasible solutions. Following common practice, we term this topic combinatorial optimization. There are now a number of excellent graduate-level textbooks on combina torial optimization. However, there does not seem to exist an undergraduate text in this area. This book is designed to fill this need. The book is intended for undergraduates in mathematics, engineering, business, or the physical or social sciences. It may also be useful as a reference text for practising engineers and scientists. The writing of this book was inspired through the experience of the author in teaching the material to undergraduate students in operations research, engineering, business, and mathematics at the University of Canterbury, New Zealand. This experience has confirmed the suspicion that it is often wise to adopt the following approach when teaching material of the nature contained in this book. When introducing a new topic, begin with a numerical problem which the students can readily understand; develop a solution technique by using it on this problem; then go on to general problems. This philosophy has been adopted throughout the book. The emphasis is on plausibility and clarity rather than rigor, although rigorous arguments have been used when they contribute to the understanding of the mechanics of an algorithm.

Author : Christos H. Papadimitriou,Kenneth Steiglitz
Publisher : Courier Corporation
Page : 528 pages
File Size : 53,5 Mb
Release : 2013-04-26
Category : Mathematics
ISBN : 9780486320137

Get Book

Combinatorial Optimization by Christos H. Papadimitriou,Kenneth Steiglitz Pdf

This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition.

Author : Alberto Del Pia,Volker Kaibel
Publisher : Springer Nature
Page : 494 pages
File Size : 49,8 Mb
Release : 2023-05-21
Category : Computers
ISBN : 9783031327261

Get Book

Integer Programming and Combinatorial Optimization by Alberto Del Pia,Volker Kaibel Pdf

This 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 : Ding-Zhu Du,Panos M. Pardalos,Zhao Zhang
Publisher : Springer
Page : 315 pages
File Size : 55,5 Mb
Release : 2019-05-31
Category : Mathematics
ISBN : 9783030161941

Get Book

Nonlinear Combinatorial Optimization by Ding-Zhu Du,Panos M. Pardalos,Zhao Zhang Pdf

Graduate students and researchers in applied mathematics, optimization, engineering, computer science, and management science will find this book a useful reference which provides an introduction to applications and fundamental theories in nonlinear combinatorial optimization. Nonlinear combinatorial optimization is a new research area within combinatorial optimization and includes numerous applications to technological developments, such as wireless communication, cloud computing, data science, and social networks. Theoretical developments including discrete Newton methods, primal-dual methods with convex relaxation, submodular optimization, discrete DC program, along with several applications are discussed and explored in this book through articles by leading experts.

Author : Bastien Chopard,Marco Tomassini
Publisher : Springer
Page : 226 pages
File Size : 45,5 Mb
Release : 2018-11-02
Category : Computers
ISBN : 9783319930732

Get Book

An Introduction to Metaheuristics for Optimization by Bastien Chopard,Marco Tomassini Pdf

The authors stress the relative simplicity, efficiency, flexibility of use, and suitability of various approaches used to solve difficult optimization problems. The authors are experienced, interdisciplinary lecturers and researchers and in their explanations they demonstrate many shared foundational concepts among the key methodologies. This textbook is a suitable introduction for undergraduate and graduate students, researchers, and professionals in computer science, engineering, and logistics.

Author : Matteo Fischetti,David P. Williamson
Publisher : Springer
Page : 502 pages
File Size : 53,8 Mb
Release : 2007-06-26
Category : Computers
ISBN : 9783540727927

Get Book

Integer Programming and Combinatorial Optimization by Matteo Fischetti,David P. Williamson Pdf

This 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 : Vangelis Th. Paschos
Publisher : John Wiley & Sons
Page : 450 pages
File Size : 54,6 Mb
Release : 2014-09-15
Category : Mathematics
ISBN : 9781848216587

Get Book

Applications of Combinatorial Optimization by Vangelis Th. Paschos Pdf

Combinatorial 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.