Results 261 to 270 of about 39,679 (279)
Some of the next articles are maybe not open access.
Oberwolfach Reports, 2012
Combinatorial Optimization is a very active field that benefits from bringing together ideas from different areas, e.g., graph theory and combinatorics, matroids and submodularity, connectivity and network flows, approximation algorithms and mathematical programming, discrete and computational geometry, discrete and continuous problems, algebraic and ...
Michel X. Goemans +2 more
openaire +2 more sources
Combinatorial Optimization is a very active field that benefits from bringing together ideas from different areas, e.g., graph theory and combinatorics, matroids and submodularity, connectivity and network flows, approximation algorithms and mathematical programming, discrete and computational geometry, discrete and continuous problems, algebraic and ...
Michel X. Goemans +2 more
openaire +2 more sources
2014
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 ...
openaire +2 more sources
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 ...
openaire +2 more sources
Oberwolfach Reports, 2019
Combinatorial Optimization is an active research area that developed from the rich interaction among many mathematical areas, including combinatorics, graph theory, geometry, optimization, probability, theoretical computer science, and many others. It combines algorithmic and complexity analysis with a mature mathematical foundation and it yields both ...
Jesús De Loera +2 more
openaire +1 more source
Combinatorial Optimization is an active research area that developed from the rich interaction among many mathematical areas, including combinatorics, graph theory, geometry, optimization, probability, theoretical computer science, and many others. It combines algorithmic and complexity analysis with a mature mathematical foundation and it yields both ...
Jesús De Loera +2 more
openaire +1 more source
2018
Combinatorial Optimization is an active research area that developed from the rich interaction among many mathematical areas, including combinatorics, graph theory, geometry, optimization, probability, theoretical computer science, and many others. It combines algorithmic and complexity analysis with a mature mathematical foundation and it yields both ...
openaire +2 more sources
Combinatorial Optimization is an active research area that developed from the rich interaction among many mathematical areas, including combinatorics, graph theory, geometry, optimization, probability, theoretical computer science, and many others. It combines algorithmic and complexity analysis with a mature mathematical foundation and it yields both ...
openaire +2 more sources
2011
Combinatorial Optimization is a very active field that benefits from bringing together ideas from different areas, e.g., graph theory and combinatorics, matroids and submodularity, connectivity and network flows, approximation algorithms and mathematical programming, discrete and computational geometry, discrete and continuous problems, algebraic and ...
openaire +1 more source
Combinatorial Optimization is a very active field that benefits from bringing together ideas from different areas, e.g., graph theory and combinatorics, matroids and submodularity, connectivity and network flows, approximation algorithms and mathematical programming, discrete and computational geometry, discrete and continuous problems, algebraic and ...
openaire +1 more source
2001
Preface 1. Clutters 2. T-Cuts and T-Joins 3. Perfect Graphs and Matrices 4. Ideal Matrices 5. Odd Cycles in Graphs 6. 0,+1 Matrices and Integral Polyhedra 7. Signing 0,1 Matrices to Be Totally Unimodular or Balanced 8. Decomposition by k-Sum 9. Decomposition of Balanced Matrices 10. Decomposition of Perfect Graphs Bibliography Index.
openaire +1 more source
Preface 1. Clutters 2. T-Cuts and T-Joins 3. Perfect Graphs and Matrices 4. Ideal Matrices 5. Odd Cycles in Graphs 6. 0,+1 Matrices and Integral Polyhedra 7. Signing 0,1 Matrices to Be Totally Unimodular or Balanced 8. Decomposition by k-Sum 9. Decomposition of Balanced Matrices 10. Decomposition of Perfect Graphs Bibliography Index.
openaire +1 more source