Pages that link to "Item:Q1805449"

The following pages link to A Monge property for the \(d\)-dimensional transportation problem (Q1805449):

Displaying 24 items.

• The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← links)
• A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs (Q685703) (← links)
• Geometric three-dimensional assignment problems (Q1278259) (← links)
• The nucleon of cooperative games and an algorithm for matching games (Q1290660) (← links)
• Recognition of \(d\)-dimensional Monge arrays (Q1329798) (← links)
• On Monge sequences in \(d\)-dimensional arrays (Q1375084) (← links)
• Weak Monge arrays in higher dimensions (Q1584367) (← links)
• Open shop scheduling with synchronization (Q1702656) (← links)
• A greedy algorithm for solving ordinary transportation problem with capacity constraints (Q1728270) (← links)
• Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
• On the recognition of permuted bottleneck Monge matrices (Q1902890) (← links)
• Three-dimensional axial assignment problems with decomposable cost coefficients (Q1917264) (← links)
• Submodular linear programs on forests (Q1919093) (← links)
• Perspectives of Monge properties in optimization (Q1923588) (← links)
• A generalization for the expected value of the earth mover's distance (Q2076290) (← links)
• On a property of a three-dimensional matrix (Q2249936) (← links)
• Properties of the \(d\)-dimensional Earth mover's problem (Q2312655) (← links)
• Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
• Monge properties, discrete convexity and applications (Q2432877) (← links)
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q2980928) (← links)
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q4622772) (← links)
• Dynamic discrete tomography (Q4634750) (← links)
• Comparing weighted difference and Earth mover's distance via Young diagrams (Q6080126) (← links)
• A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case (Q6130232) (← links)