Pages that link to "Item:Q1837625"
From MaRDI portal
The following pages link to Complexity of a 3-dimensional assignment problem (Q1837625):
Displaying 38 items.
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417) (← links)
- Cycle-based reducibility of multi-index transport-type systems of linear inequalities (Q357096) (← links)
- A reduction approach to the repeated assignment problem (Q531433) (← links)
- Round robin tournaments and three index assignments (Q633482) (← links)
- Three-index linear programs with nested structure (Q664295) (← links)
- 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)
- The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
- The constant objective value property for multidimensional assignment problems (Q1751146) (← links)
- Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables (Q1754029) (← 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)
- A new greedy algorithm for the quadratic assignment problem (Q1940429) (← links)
- Envy-free matchings with lower quotas (Q1986955) (← links)
- Decomposition method for solving a three-index planar assignment problem (Q1995353) (← links)
- Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← 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)
- Complexity of a disjoint matching problem on bipartite graphs (Q2629777) (← links)
- A preemptive open shop scheduling problem with one resource (Q2641218) (← links)
- A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem (Q2684046) (← links)
- A characterization of odd-hole inequalities related to Latin squares (Q2868928) (← links)
- Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms (Q3386794) (← links)
- On linear programs with random costs (Q3724096) (← links)
- Index Matrices as a Cost Optimization Tool of Resource Provisioning in Uncertain Cloud Computing Environment (Q5051125) (← links)
- Efficient algorithms for three‐dimensional axial and planar random assignment problems (Q5175234) (← links)
- Tool switching problems with tool order constraints (Q6202949) (← links)