Pages that link to "Item:Q2432877"

The following pages link to Monge properties, discrete convexity and applications (Q2432877):

Displaying 16 items.

• The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← links)
• Cooperative assignment games with the inverse Monge property (Q741716) (← links)
• Structure and dimension of the eigenspace of a concave Monge matrix (Q1028473) (← links)
• A note on the single machine scheduling to minimize the number of tardy jobs with deadlines (Q1038367) (← links)
• Allocation under a general substitution structure (Q1737487) (← links)
• Estimation of Monge matrices (Q2203631) (← links)
• Properties of the \(d\)-dimensional Earth mover's problem (Q2312655) (← links)
• Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
• Resequencing a set of strings based on a target string (Q2354022) (← links)
• Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
• Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs (Q2811304) (← links)
• Traditional Inventory Models for Better Price Competitiveness (Q2950476) (← links)
• Sequence Alignment Algorithms for Run-Length-Encoded Strings (Q3511343) (← links)
• Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem (Q4995102) (← links)
• (Q5091741) (← links)
• Inventory allocation with full downward substitution and monotone cost differences (Q6106969) (← links)