Pages that link to "Item:Q1116656"

The following pages link to An algorithm for the detection and construction of Monge sequences (Q1116656):

Displaying 19 items.

• Recognition of overlap graphs (Q405660) (← links)
• A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs (Q685703) (← links)
• Monge and feasibility sequences in general flow problems (Q686244) (← links)
• Monge sequences, antimatroids, and the transportation problem with forbidden arcs (Q916563) (← links)
• Minimizing the number of tardy job units under release time constraints (Q919993) (← links)
• The \(S\)-digraph optimization problem and the greedy algorithm (Q1019296) (← links)
• Some recent results in the analysis of greedy algorithms for assignment problems (Q1317524) (← 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)
• Allocation under a general substitution structure (Q1737487) (← links)
• Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
• On the recognition of permuted bottleneck Monge matrices (Q1902890) (← links)
• Perspectives of Monge properties in optimization (Q1923588) (← links)
• Monge properties, discrete convexity and applications (Q2432877) (← links)
• Planning for End-User Substitution in Agribusiness (Q3387949) (← links)
• Optimal couplings are totally positive and more (Q4822470) (← links)
• Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem (Q4995102) (← links)
• Inventory allocation with full downward substitution and monotone cost differences (Q6106969) (← links)