Pages that link to "Item:Q1917272"
From MaRDI portal
The following pages link to Time-tables, polyhedra and the greedy algorithm (Q1917272):
Displaying 5 items.
- Selected topics on assignment problems (Q697571) (← links)
- On the completability of incomplete Latin squares (Q966163) (← links)
- Clique facets of the axial and planar assignment polytopes (Q1040085) (← links)
- On multi-index assignment polytopes (Q2494661) (← links)
- A characterization of odd-hole inequalities related to Latin squares (Q2868928) (← links)
