Pages that link to "Item:Q1917264"
From MaRDI portal
The following pages link to Three-dimensional axial assignment problems with decomposable cost coefficients (Q1917264):
Displaying 33 items.
- The focus of attention problem (Q262243) (← links)
- The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← links)
- Local search heuristics for the multidimensional assignment problem (Q544814) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- A hybrid genetic algorithm for the three-index assignment problem (Q818096) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors (Q1026115) (← links)
- Clique facets of the axial and planar assignment polytopes (Q1040085) (← links)
- Lower bounds for the axial three-index assignment problem (Q1040985) (← links)
- Geometric three-dimensional assignment problems (Q1278259) (← links)
- Efficient sensor network management for asset localization (Q1654358) (← links)
- Geometric versions of the three-dimensional assignment problem under general norms (Q1751127) (← links)
- Test problem generator for the multidimensional assignment problem (Q1774571) (← links)
- Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems (Q1808370) (← links)
- Scheduling sports competitions on multiple venues. (Q1810517) (← links)
- Extremal circular permutations with concave functions (Q1883620) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- Between a rock and a hard place: the two-to-one assignment problem (Q1935948) (← links)
- Combining solutions of the axial assignment problem (Q2052595) (← links)
- On a property of a three-dimensional matrix (Q2249936) (← links)
- Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
- Multi-index transport problems with decomposition structure (Q2261688) (← links)
- An adaptive algorithm for solving the axial three-index assignment problem (Q2290404) (← links)
- Multi-dimensional vector assignment problems (Q2339839) (← links)
- Fast separation for the three-index assignment problem (Q2398106) (← links)
- Monge properties, discrete convexity and applications (Q2432877) (← links)
- On multi-index assignment polytopes (Q2494661) (← links)
- Replication and sequencing of unreliable jobs on parallel machines (Q2669802) (← links)
- Optimal power control in OFDMA cellular networks (Q3008916) (← links)
- Efficient algorithms for three‐dimensional axial and planar random assignment problems (Q5175234) (← links)
- Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem (Q5413067) (← links)
- On the Computational Complexity of Peer-to-Peer Satellite Refueling Strategies (Q6102750) (← links)
- Criteria convolutions when combining the solutions of the multicriteria axial assignment problem (Q6646031) (← links)