File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Appears in Collections:
Conference Paper: Recent Advances in Polyhedral Combinatorics
| Title | Recent Advances in Polyhedral Combinatorics |
|---|---|
| Authors | |
| Issue Date | 2017 |
| Citation | Workshop on Structural Graph Theory and Discrete Optimization (SGTDOM 2017), Tsinghua Sanya International Mathematics Forum (TSIMF), Sanya, Hainan, China, 29 May - 2 June 2017 How to Cite? |
| Abstract | Combinatorial optimization searches for an optimal object in a finite collection; typically the collection has a concise representation while the number of objects is huge. Polyhedral and linear programming techniques have proved to be very powerful and successful in tackling various combinatorial optimization problems, and the end products of these methods are often integral polyhedra or min-max relations. This area of combinatorial optimization is called polyhedral combinatorics. In this talk I shall give a brief survey of our recent results on polyhedral combinatorics, including a tournament ranking with no errors, a polyhedral description of kernels, and a characterization of the box-totally dual integral (box-TDI) matching polytope. |
| Persistent Identifier | http://hdl.handle.net/10722/252389 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Zang, W | - |
| dc.date.accessioned | 2018-04-19T07:46:59Z | - |
| dc.date.available | 2018-04-19T07:46:59Z | - |
| dc.date.issued | 2017 | - |
| dc.identifier.citation | Workshop on Structural Graph Theory and Discrete Optimization (SGTDOM 2017), Tsinghua Sanya International Mathematics Forum (TSIMF), Sanya, Hainan, China, 29 May - 2 June 2017 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/252389 | - |
| dc.description.abstract | Combinatorial optimization searches for an optimal object in a finite collection; typically the collection has a concise representation while the number of objects is huge. Polyhedral and linear programming techniques have proved to be very powerful and successful in tackling various combinatorial optimization problems, and the end products of these methods are often integral polyhedra or min-max relations. This area of combinatorial optimization is called polyhedral combinatorics. In this talk I shall give a brief survey of our recent results on polyhedral combinatorics, including a tournament ranking with no errors, a polyhedral description of kernels, and a characterization of the box-totally dual integral (box-TDI) matching polytope. | - |
| dc.language | eng | - |
| dc.relation.ispartof | Workshop on Structural Graph Theory and Discrete Optimization, Tsinghua Sanya International Mathematics Forum (TSIMF), Hainan, China | - |
| dc.title | Recent Advances in Polyhedral Combinatorics | - |
| dc.type | Conference_Paper | - |
| dc.identifier.email | Zang, W: wzang@maths.hku.hk | - |
| dc.identifier.authority | Zang, W=rp00839 | - |
| dc.identifier.hkuros | 282686 | - |