A Separation Algorithm for <i>b</i>-Matching Degree-Sequence Polyhedra (Q5704115): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/moor.28.1.92.14263 / rank | |||
| Property / author | |||
| Property / author: Fan Zhang / rank | |||
| Property / author | |||
| Property / author: Fan Zhang / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.28.1.92.14263 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013168998 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MOOR.28.1.92.14263 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:23, 30 December 2024
scientific article; zbMATH DE number 2228280
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Separation Algorithm for <i>b</i>-Matching Degree-Sequence Polyhedra |
scientific article; zbMATH DE number 2228280 |
Statements
A Separation Algorithm for <i>b</i>-Matching Degree-Sequence Polyhedra (English)
0 references
11 November 2005
0 references
combinatorial optimization
0 references
\(b\)-matching
0 references
degree sequence
0 references
polyhedron combinatorics
0 references
