Combinatorial optimization. Abstracts from the workshop held November 9--15, 2014. (Q347232): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
Summary: Combinatorial Optimization is an area of mathematics that thrives from a continual influx of new questions and problems from practice. Attacking these problems has required the development and combination of ideas and techniques from different mathematical areas including graph theory, matroids and combinatorics, convex and nonlinear optimization, discrete and convex geometry, algebraic and topological methods. We continued a tradition of triannual Oberwolfach workshops, bringing together the best international researchers with younger talent to discover new connections with a particular emphasis on emerging breakthrough areas. | |||
Property / review text: Summary: Combinatorial Optimization is an area of mathematics that thrives from a continual influx of new questions and problems from practice. Attacking these problems has required the development and combination of ideas and techniques from different mathematical areas including graph theory, matroids and combinatorics, convex and nonlinear optimization, discrete and convex geometry, algebraic and topological methods. We continued a tradition of triannual Oberwolfach workshops, bringing together the best international researchers with younger talent to discover new connections with a particular emphasis on emerging breakthrough areas. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 00B05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 00B25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90-06 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C11 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C57 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6658033 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximating the independence number via the \(\vartheta\)-function / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3002828 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Independence numbers of locally sparse graphs and a Ramsey type problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Lovász Theta function for Independent Sets in Sparse Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation resistance from pairwise independent subgroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the independence number of sparse graphs / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.4171/owr/2014/51 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4241216116 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:40, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Combinatorial optimization. Abstracts from the workshop held November 9--15, 2014. |
scientific article |
Statements
Combinatorial optimization. Abstracts from the workshop held November 9--15, 2014. (English)
0 references
30 November 2016
0 references
Summary: Combinatorial Optimization is an area of mathematics that thrives from a continual influx of new questions and problems from practice. Attacking these problems has required the development and combination of ideas and techniques from different mathematical areas including graph theory, matroids and combinatorics, convex and nonlinear optimization, discrete and convex geometry, algebraic and topological methods. We continued a tradition of triannual Oberwolfach workshops, bringing together the best international researchers with younger talent to discover new connections with a particular emphasis on emerging breakthrough areas.
0 references
0 references