Pages that link to "Item:Q1837625"
From MaRDI portal
The following pages link to Complexity of a 3-dimensional assignment problem (Q1837625):
Displayed 19 items.
- Selected topics on assignment problems (Q697571) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- Lower bounds for the axial three-index assignment problem (Q1040985) (← links)
- On the complexity of decomposing matrices arising in satellite communication (Q1060960) (← links)
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm (Q1068720) (← links)
- A variant of time minimizing assignment problem (Q1303581) (← links)
- An algorithm for the planar three-index assignment problem (Q1333481) (← links)
- Arrays of distinct representatives --- a very simple NP-complete problem (Q1363713) (← links)
- Linear-time separation algorithms for the three-index assignment polytope (Q1801663) (← links)
- On Latin squares and the facial structure of related polytopes (Q1820162) (← links)
- Time-slot assignment for TDMA-systems (Q2265947) (← links)
- Facets of the three-index assignment polytope (Q2276881) (← links)
- Polyhedral combinatorics of multi-index axial transportation problems (Q2482774) (← links)
- A new class of facets for the Latin square polytope (Q2492192) (← links)
- On multi-index assignment polytopes (Q2494661) (← links)
- A preemptive open shop scheduling problem with one resource (Q2641218) (← links)
- On linear programs with random costs (Q3724096) (← links)