- Table View
- List View
Combinatorial Optimization: 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020, Revised Selected Papers (Lecture Notes in Computer Science #12176)
by Mourad Baïou Bernard Gendron Oktay Günlük A. Ridha MahjoubThis book constitutes the thoroughly refereed post-conference proceedings of the 6th International Symposium on Combinatorial Optimization, ISCO 2020, which was due to be held in Montreal, Canada, in May 2020. The conference was held virtually due to the COVID-19 pandemic.The 24 revised full papers presented in this book were carefully reviewed and selected from 66 submissions.They were organized in the following topical sections: polyhedral combinatorics; integer programming; scheduling; matching; Network Design; Heuristics.
Combinatorial Optimization: 4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers (Lecture Notes in Computer Science #9849)
by Raffaele Cerulli Satoru Fujishige A. Ridha MahjoubThis 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.
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics #21)
by Bernhard Korte Jens VygenThis comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial optimization.
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics #21)
by Bernhard Korte Jens VygenThis 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.
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)
by Bernhard Korte Jens VygenNow fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization. It puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete but concise proofs, also for many deep results, some of which have not appeared in print before. Recent topics are covered as well, and numerous references are provided. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added.
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics #21)
by Bernhard Korte Jens VygenThis 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.
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)
by Bernhard Korte Jens VygenThis 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.
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics #21)
by Bernhard Korte Jens VygenThis comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.
Combinatorial Optimization: 7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022, Revised Selected Papers (Lecture Notes in Computer Science #13526)
by Ivana Ljubić Francisco Barahona Santanu S. Dey A. Ridha MahjoubThis book constitutes thoroughly refereed and revised selected papers from the 7th International Symposium on Combinatorial Optimization, ISCO 2022, which was held online during May 18–20, 2022.The 24 full papers included in this book were carefully reviewed and selected from 50 submissions. They were organized in topical sections as follows: Polyhedra and algorithms; polyhedra and combinatorics; non-linear optimization; game theory; graphs and trees; cutting and packing; applications; and approximation algorithms.
Combinatorial Optimization: Second International Symposium, ISCO 2012, Athens, Greece, 19-21, Revised Selected Papers (Lecture Notes in Computer Science #7422)
by A. Ridha Mahjoub Vangelis Markakis Ioannis Milis Vangelis Th. PaschosThis book constitutes the thoroughly refereed post-conference proceedings of the Second International Symposium on Combinatorial Optimization, ISCO 2012, held in Athens, Greece, in April 2012. The 37 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 94 regular and 30 short submissions. They present original research on all aspects of combinatorial optimization, ranging from mathematical foundations and theory of algorithms to computational studies and practical applications.
Combinatorial Optimization: Third International Symposium, Isco 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers (Lecture Notes in Computer Science #8596)
by A. Ridha Mahjoub Giovanni Rinaldi Jon LeeThis book constitutes the thoroughly refereed post-conference proceedings of the 5th International Symposium on Combinatorial Optimization, ISCO 2017, held in Marrakesh, Marocco, in April 2018. The 35 revised full papers presented in this book were carefully reviewed and selected from 75 submissions. The symposium aims to bring together researchers from all the communities related to combinatorial optimization, including algorithms and complexity, mathematical programming and operations research.
Combinatorial Optimization: Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers (Lecture Notes in Computer Science #8596)
by Pierre Fouilhoux, Luis Eduardo Neves Gouveia, A. Ridha Mahjoub and Vangelis T. PaschosThis 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.
Combinatorial Optimization and Applications: First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings (Lecture Notes in Computer Science #4616)
by Andreas Dress Yinfeng Xu Binhai ZhuRunning to almost 400 pages, and featuring more than 40 papers, this work on combinatorial optimization and applications will be seen as an important addition to the literature. It constitutes the refereed proceedings of the first International Conference on Combinatorial Optimization and Applications, COCOA 2007, held in Xi'an, China in August of that year. The 29 revised full papers presented together with 8 invited papers and 2 invited presentations were carefully reviewed and selected from 114 submissions and cover both theoretical issues and practical applications.
Combinatorial Optimization and Applications: 15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings (Lecture Notes in Computer Science #13135)
by Ding-Zhu Du Donglei Du Chenchen Wu Dachuan XuThis book constitutes the refereed proceedings of the 15th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2021, which took place in Tianjin, China, during December 17-19, 2021.The 55 papers presented in this volume were carefully reviewed and selected from 122 submissions. They deal with combinatorial optimization and its applications in general, focusing on algorithms design, theoretical and experimental analysis, and applied research of general algorithmic interest.
Combinatorial Optimization and Applications: Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings (Lecture Notes in Computer Science #5573)
by Ding-Zhu Du Xiaodong Hu Panos M. PardalosThis book constitutes the refereed proceedings of the Third International Conference on Combinatorial Optimization and Applications, COCOA 2009, held in Huangshan, China, in June 2009. The 50 revised full papers were carefully reviewed and selected from 103 submissions. The papers feature original research in the areas of combinatorial optimization - both theoretical issues and and applications motivated by real-world problems thus showing convincingly the usefulness and efficiency of the algorithms discussed in a practical setting.
Combinatorial Optimization and Applications: 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings (Lecture Notes in Computer Science #11346)
by Donghyun Kim R. N. Uma Alexander ZelikovskyThe conference proceeding LNCS 11346 constitutes the refereed proceedings of the 12th International Conference on Combinatorial Optimization and Applications, COCOA 2018, held in Atlanta, GA, USA, in December 2018. The 50 full papers presented were carefully reviewed and selected from 106 submissions. The papers cover most aspects of t graph algorithms, routing and network design problems, scheduling algorithms, network optimization, combinatorial algorithms, approximation algorithms, paths and connectivity problems and much more.
Combinatorial Optimization and Applications: 13th International Conference, COCOA 2019, Xiamen, China, December 13–15, 2019, Proceedings (Lecture Notes in Computer Science #11949)
by Yingshu Li Mihaela Cardei Yan HuangThis volume constitutes the proceedings of the 13th International Conference on Combinatorial Optimization and Applications, COCOA 2019, held in Xiamen, China, in December 2019. The 49 full papers presented in this volume were carefully reviewed and selected from 108 submissions. The papers cover the various topics, including cognitive radio networks, wireless sensor networks, cyber-physical systems, distributed and localized algorithm design and analysis, information and coding theory for wireless networks, localization, mobile cloud computing, topology control and coverage, security and privacy, underwater and underground networks, vehicular networks, information processing and data management, programmable service interfaces, energy-efficient algorithms, system and protocol design, operating system and middleware support, and experimental test-beds, models and case studies.
Combinatorial Optimization and Applications: 6th International Conference, COCOA 2012, Banff, AB, Canada, August 5-9, 2012, Proceedings (Lecture Notes in Computer Science #7402)
by Guohui LinThis book constitutes the refereed proceedings of the 6th International Conference, COCOA 2012, held in Banff, Alberta, Canada, in August 2012. The 33 revised papers including one invited talk and one keynote talk were carefully reviewed and selected from 57 submissions. The papers are focused to theoretical results and also on recent works on experimental and applied research of general algorithmic interest.
Combinatorial Optimization and Applications: 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings (Lecture Notes in Computer Science #9486)
by Zaixin Lu Donghyun Kim Weili Wu Wei Li Ding-Zhu DuThis book constitutes the refereed proceedings of the 9th International Conference on Combinatorial Optimization and Applications, COCOA 2015, held in Houston, TX, USA, in December 2015. The 59 full papers included in the book were carefully reviewed and selected from 125 submissions. Topics covered include classic combinatorial optimization; geometric optimization; network optimization; applied optimization; complexity and game; and optimization in graphs.
Combinatorial Optimization and Applications: 10th International Conference, COCOA 2016, Hong Kong, China, December 16–18, 2016, Proceedings (Lecture Notes in Computer Science #10043)
by T-H. Hubert Chan Minming Li Lusheng WangThis book constitutes the refereed proceedings of the 10th International Conference on Combinatorial Optimization and Applications, COCOA 2016, held in Hong Kong, China, in December 2016. The 60 full papers included in the book were carefully reviewed and selected from 122 submissions. The papers are organized in topical sections such as graph theory, geometric optimization, complexity and data structure, combinatorial optimization, and miscellaneous.
Combinatorial Optimization and Applications: 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011, Proceedings (Lecture Notes in Computer Science #6831)
by Weifan Wang Xuding Zhu Ding-Zhu DuThis book constitutes the refereed proceedings of the 5th International Conference on Combinatorial Optimization and Applications, COCOA 2011, held in Zhangjiajie, China, in August 2011. The 43 revised full papers were carefully reviewed and selected from 65 submissions. The papers cover a broad range of topics in combinatorial optimization and applications focussing on experimental and applied research of general algorithmic interest and research motivated by real-world problems.
Combinatorial Optimization and Applications: 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings (Lecture Notes in Computer Science #8287)
by Peter Widmayer Yinfeng Xu Binhai ZhuThis book constitutes the refereed proceedings of the 7th International Conference on Combinatorial Optimization and Applications, COCOA 2013, held in Chengdu, China, in December 2013. The 36 full papers presented were carefully reviewed and selected from 72 submissions. The papers feature original research in the areas of combinatorial optimization and its applications. In addition to theoretical results there are reports on experimental and applied research of general algorithmic interest.
Combinatorial Optimization and Applications: 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II (Lecture Notes in Computer Science #6509)
by Weili Wu Ovidiu DaescuThe 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010) took place in Big Island, Hawaii, USA, December 18–20, 2010. Past COCOA conferences were held in Xi’an, China (2007), Newfoundland, Canada (2008)and Huangshan, China (2009). COCOA2010providedaforumforresearchersworkingintheareasofcom- natorial optimization and its applications. In addition to theoretical results, the conference also included recent works on experimental and applied research of general algorithmic interest. The Program Committee received 108 submissions from more than 23 countries and regions, including Australia, Austria, Canada, China, Denmark, France, Germany, Hong Kong, India, Italy, Japan, Korea, Mexico, New Zealand, Poland, Slovak Republic, Spain, Sweden, Switzerland, Taiwan, UK, USA, Vietnam, etc. Among the 108 submissions, 49 regular papers were selected for presentation at the conference and are included in this volume. Some of these papers will be selected for publication in a special issue of the Journal of Combinatorial Optimization, a special issue of Theoretical Computer Science, a special issue of Optimization Letters, and a special issue of Discrete Mathematics, Algorithms and Applications under the standard refereeing procedure.
Combinatorial Optimization and Applications: 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I (Lecture Notes in Computer Science #6508)
by Weili Wu Ovidiu DaescuThe 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010) took place in Big Island, Hawaii, USA, December 18–20, 2010. Past COCOA conferences were held in Xi’an, China (2007), Newfoundland, Canada (2008)and Huangshan, China (2009). COCOA2010providedaforumforresearchersworkingintheareasofcom- natorial optimization and its applications. In addition to theoretical results, the conference also included recent works on experimental and applied research of general algorithmic interest. The Program Committee received 108 submissions from more than 23 countries and regions, including Australia, Austria, Canada, China, Denmark, France, Germany, Hong Kong, India, Italy, Japan, Korea, Mexico, New Zealand, Poland, Slovak Republic, Spain, Sweden, Switzerland, Taiwan, UK, USA, Vietnam, etc. Among the 108 submissions, 49 regular papers were selected for presentation at the conference and are included in this volume. Some of these papers will be selected for publication in a special issue of the Journal of Combinatorial Optimization, a special issue of Theoretical Computer Science, a special issue of Optimization Letters, and a special issue of Discrete Mathematics, Algorithms and Applications under the standard refereeing procedure.
Combinatorial Optimization and Applications: 16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I (Lecture Notes in Computer Science #14461)
by Weili Wu Jianxiong GuoThe two-volume set LNCS 14461 and LNCS 14462 constitutes the refereed proceedings of the 17th International Conference on Combinatorial Optimization and Applications, COCOA 2023, held in Hawaii, HI, USA, during December 15–17, 2023. The 73 full papers included in the proceedings were carefully reviewed and selected from 117 submissions. They were organized in topical sections as follows: Part I: Optimization in graphs; scheduling; set-related optimization; applied optimization and algorithm; Graph planer and others;Part II: Modeling and algorithms; complexity and approximation; combinatorics and computing; optimization and algorithms; extreme graph and others; machine learning, blockchain and others.